TSTP Solution File: SEU245+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU245+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 31 18:32:48 EDT 2022
% Result : Theorem 1.67s 0.56s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of formulae : 41 ( 7 unt; 0 def)
% Number of atoms : 182 ( 16 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 219 ( 78 ~; 81 |; 48 &)
% ( 5 <=>; 6 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 86 ( 67 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f226,plain,
$false,
inference(subsumption_resolution,[],[f225,f141]) ).
fof(f141,plain,
in(sK1,sK3),
inference(duplicate_literal_removal,[],[f140]) ).
fof(f140,plain,
( in(sK1,sK3)
| in(sK1,sK3) ),
inference(resolution,[],[f138,f81]) ).
fof(f81,plain,
( in(sK1,relation_restriction(sK3,sK2))
| in(sK1,sK3) ),
inference(cnf_transformation,[],[f55]) ).
fof(f55,plain,
( ( ~ in(sK1,relation_restriction(sK3,sK2))
| ~ in(sK1,sK3)
| ~ in(sK1,cartesian_product2(sK2,sK2)) )
& ( in(sK1,relation_restriction(sK3,sK2))
| ( in(sK1,sK3)
& in(sK1,cartesian_product2(sK2,sK2)) ) )
& relation(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f53,f54]) ).
fof(f54,plain,
( ? [X0,X1,X2] :
( ( ~ in(X0,relation_restriction(X2,X1))
| ~ in(X0,X2)
| ~ in(X0,cartesian_product2(X1,X1)) )
& ( in(X0,relation_restriction(X2,X1))
| ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) ) )
& relation(X2) )
=> ( ( ~ in(sK1,relation_restriction(sK3,sK2))
| ~ in(sK1,sK3)
| ~ in(sK1,cartesian_product2(sK2,sK2)) )
& ( in(sK1,relation_restriction(sK3,sK2))
| ( in(sK1,sK3)
& in(sK1,cartesian_product2(sK2,sK2)) ) )
& relation(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f53,plain,
? [X0,X1,X2] :
( ( ~ in(X0,relation_restriction(X2,X1))
| ~ in(X0,X2)
| ~ in(X0,cartesian_product2(X1,X1)) )
& ( in(X0,relation_restriction(X2,X1))
| ( in(X0,X2)
& in(X0,cartesian_product2(X1,X1)) ) )
& relation(X2) ),
inference(rectify,[],[f52]) ).
fof(f52,plain,
? [X1,X0,X2] :
( ( ~ in(X1,relation_restriction(X2,X0))
| ~ in(X1,X2)
| ~ in(X1,cartesian_product2(X0,X0)) )
& ( in(X1,relation_restriction(X2,X0))
| ( in(X1,X2)
& in(X1,cartesian_product2(X0,X0)) ) )
& relation(X2) ),
inference(flattening,[],[f51]) ).
fof(f51,plain,
? [X1,X0,X2] :
( ( ~ in(X1,relation_restriction(X2,X0))
| ~ in(X1,X2)
| ~ in(X1,cartesian_product2(X0,X0)) )
& ( in(X1,relation_restriction(X2,X0))
| ( in(X1,X2)
& in(X1,cartesian_product2(X0,X0)) ) )
& relation(X2) ),
inference(nnf_transformation,[],[f35]) ).
fof(f35,plain,
? [X1,X0,X2] :
( ( ( in(X1,X2)
& in(X1,cartesian_product2(X0,X0)) )
<~> in(X1,relation_restriction(X2,X0)) )
& relation(X2) ),
inference(ennf_transformation,[],[f32]) ).
fof(f32,plain,
~ ! [X1,X0,X2] :
( relation(X2)
=> ( in(X1,relation_restriction(X2,X0))
<=> ( in(X1,X2)
& in(X1,cartesian_product2(X0,X0)) ) ) ),
inference(rectify,[],[f26]) ).
fof(f26,negated_conjecture,
~ ! [X1,X0,X2] :
( relation(X2)
=> ( ( in(X0,cartesian_product2(X1,X1))
& in(X0,X2) )
<=> in(X0,relation_restriction(X2,X1)) ) ),
inference(negated_conjecture,[],[f25]) ).
fof(f25,conjecture,
! [X1,X0,X2] :
( relation(X2)
=> ( ( in(X0,cartesian_product2(X1,X1))
& in(X0,X2) )
<=> in(X0,relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_wellord1) ).
fof(f138,plain,
! [X2,X3] :
( ~ in(X3,relation_restriction(sK3,X2))
| in(X3,sK3) ),
inference(superposition,[],[f113,f128]) ).
fof(f128,plain,
! [X3] : relation_restriction(sK3,X3) = set_intersection2(sK3,cartesian_product2(X3,X3)),
inference(resolution,[],[f109,f79]) ).
fof(f79,plain,
relation(sK3),
inference(cnf_transformation,[],[f55]) ).
fof(f109,plain,
! [X0,X1] :
( ~ relation(X0)
| relation_restriction(X0,X1) = set_intersection2(X0,cartesian_product2(X1,X1)) ),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0] :
( ! [X1] : relation_restriction(X0,X1) = set_intersection2(X0,cartesian_product2(X1,X1))
| ~ relation(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,axiom,
! [X0] :
( relation(X0)
=> ! [X1] : relation_restriction(X0,X1) = set_intersection2(X0,cartesian_product2(X1,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d6_wellord1) ).
fof(f113,plain,
! [X2,X1,X4] :
( ~ in(X4,set_intersection2(X2,X1))
| in(X4,X2) ),
inference(equality_resolution,[],[f89]) ).
fof(f89,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| set_intersection2(X2,X1) != X0 ),
inference(cnf_transformation,[],[f64]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ( set_intersection2(X2,X1) = X0
| ( ( ~ in(sK5(X0,X1,X2),X0)
| ~ in(sK5(X0,X1,X2),X1)
| ~ in(sK5(X0,X1,X2),X2) )
& ( in(sK5(X0,X1,X2),X0)
| ( in(sK5(X0,X1,X2),X1)
& in(sK5(X0,X1,X2),X2) ) ) ) )
& ( ! [X4] :
( ( ( in(X4,X1)
& in(X4,X2) )
| ~ in(X4,X0) )
& ( in(X4,X0)
| ~ in(X4,X1)
| ~ in(X4,X2) ) )
| set_intersection2(X2,X1) != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f62,f63]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( in(X3,X0)
| ( in(X3,X1)
& in(X3,X2) ) ) )
=> ( ( ~ in(sK5(X0,X1,X2),X0)
| ~ in(sK5(X0,X1,X2),X1)
| ~ in(sK5(X0,X1,X2),X2) )
& ( in(sK5(X0,X1,X2),X0)
| ( in(sK5(X0,X1,X2),X1)
& in(sK5(X0,X1,X2),X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ( set_intersection2(X2,X1) = X0
| ? [X3] :
( ( ~ in(X3,X0)
| ~ in(X3,X1)
| ~ in(X3,X2) )
& ( in(X3,X0)
| ( in(X3,X1)
& in(X3,X2) ) ) ) )
& ( ! [X4] :
( ( ( in(X4,X1)
& in(X4,X2) )
| ~ in(X4,X0) )
& ( in(X4,X0)
| ~ in(X4,X1)
| ~ in(X4,X2) ) )
| set_intersection2(X2,X1) != X0 ) ),
inference(rectify,[],[f61]) ).
fof(f61,plain,
! [X2,X1,X0] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( in(X3,X2)
| ( in(X3,X1)
& in(X3,X0) ) ) ) )
& ( ! [X3] :
( ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f60]) ).
fof(f60,plain,
! [X2,X1,X0] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( in(X3,X2)
| ( in(X3,X1)
& in(X3,X0) ) ) ) )
& ( ! [X3] :
( ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,axiom,
! [X2,X1,X0] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( ( in(X3,X1)
& in(X3,X0) )
<=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f225,plain,
~ in(sK1,sK3),
inference(subsumption_resolution,[],[f221,f197]) ).
fof(f197,plain,
in(sK1,relation_restriction(sK3,sK2)),
inference(duplicate_literal_removal,[],[f196]) ).
fof(f196,plain,
( in(sK1,relation_restriction(sK3,sK2))
| in(sK1,relation_restriction(sK3,sK2)) ),
inference(resolution,[],[f191,f80]) ).
fof(f80,plain,
( in(sK1,cartesian_product2(sK2,sK2))
| in(sK1,relation_restriction(sK3,sK2)) ),
inference(cnf_transformation,[],[f55]) ).
fof(f191,plain,
! [X0] :
( ~ in(sK1,cartesian_product2(X0,X0))
| in(sK1,relation_restriction(sK3,X0)) ),
inference(resolution,[],[f137,f141]) ).
fof(f137,plain,
! [X0,X1] :
( ~ in(X1,sK3)
| ~ in(X1,cartesian_product2(X0,X0))
| in(X1,relation_restriction(sK3,X0)) ),
inference(superposition,[],[f114,f128]) ).
fof(f114,plain,
! [X2,X1,X4] :
( in(X4,set_intersection2(X2,X1))
| ~ in(X4,X2)
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f88]) ).
fof(f88,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X2,X1) != X0 ),
inference(cnf_transformation,[],[f64]) ).
fof(f221,plain,
( ~ in(sK1,relation_restriction(sK3,sK2))
| ~ in(sK1,sK3) ),
inference(resolution,[],[f217,f82]) ).
fof(f82,plain,
( ~ in(sK1,cartesian_product2(sK2,sK2))
| ~ in(sK1,relation_restriction(sK3,sK2))
| ~ in(sK1,sK3) ),
inference(cnf_transformation,[],[f55]) ).
fof(f217,plain,
in(sK1,cartesian_product2(sK2,sK2)),
inference(resolution,[],[f197,f139]) ).
fof(f139,plain,
! [X4,X5] :
( ~ in(X5,relation_restriction(sK3,X4))
| in(X5,cartesian_product2(X4,X4)) ),
inference(superposition,[],[f112,f128]) ).
fof(f112,plain,
! [X2,X1,X4] :
( ~ in(X4,set_intersection2(X2,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f90]) ).
fof(f90,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X0)
| set_intersection2(X2,X1) != X0 ),
inference(cnf_transformation,[],[f64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU245+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 15:08:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.51 % (4820)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.52 % (4812)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.54 % (4812)First to succeed.
% 1.31/0.54 % (4815)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 1.31/0.56 % (4835)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 1.31/0.56 % (4823)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.31/0.56 % (4825)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 1.67/0.56 % (4812)Refutation found. Thanks to Tanya!
% 1.67/0.56 % SZS status Theorem for theBenchmark
% 1.67/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.67/0.56 % (4812)------------------------------
% 1.67/0.56 % (4812)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.67/0.56 % (4812)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.67/0.56 % (4812)Termination reason: Refutation
% 1.67/0.56
% 1.67/0.56 % (4812)Memory used [KB]: 1023
% 1.67/0.56 % (4812)Time elapsed: 0.144 s
% 1.67/0.56 % (4812)Instructions burned: 7 (million)
% 1.67/0.56 % (4812)------------------------------
% 1.67/0.56 % (4812)------------------------------
% 1.67/0.56 % (4809)Success in time 0.212 s
%------------------------------------------------------------------------------