TSTP Solution File: SEU102+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU102+1 : TPTP v8.1.0. Released v3.2.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 : n007.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:31:56 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 7
% Syntax : Number of formulae : 51 ( 22 unt; 0 def)
% Number of atoms : 153 ( 22 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 167 ( 65 ~; 49 |; 42 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 78 ( 66 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f422,plain,
$false,
inference(subsumption_resolution,[],[f421,f322]) ).
fof(f322,plain,
element(set_difference(sK8,sK7),sK6),
inference(subsumption_resolution,[],[f321,f159]) ).
fof(f159,plain,
element(sK8,sK6),
inference(cnf_transformation,[],[f106]) ).
fof(f106,plain,
( ~ element(set_intersection2(sK8,sK7),sK6)
& element(sK7,sK6)
& element(sK8,sK6)
& preboolean(sK6)
& ~ empty(sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f104,f105]) ).
fof(f105,plain,
( ? [X0,X1,X2] :
( ~ element(set_intersection2(X2,X1),X0)
& element(X1,X0)
& element(X2,X0)
& preboolean(X0)
& ~ empty(X0) )
=> ( ~ element(set_intersection2(sK8,sK7),sK6)
& element(sK7,sK6)
& element(sK8,sK6)
& preboolean(sK6)
& ~ empty(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f104,plain,
? [X0,X1,X2] :
( ~ element(set_intersection2(X2,X1),X0)
& element(X1,X0)
& element(X2,X0)
& preboolean(X0)
& ~ empty(X0) ),
inference(rectify,[],[f60]) ).
fof(f60,plain,
? [X1,X2,X0] :
( ~ element(set_intersection2(X0,X2),X1)
& element(X2,X1)
& element(X0,X1)
& preboolean(X1)
& ~ empty(X1) ),
inference(flattening,[],[f59]) ).
fof(f59,plain,
? [X0,X1,X2] :
( ~ element(set_intersection2(X0,X2),X1)
& element(X0,X1)
& element(X2,X1)
& ~ empty(X1)
& preboolean(X1) ),
inference(ennf_transformation,[],[f45]) ).
fof(f45,plain,
~ ! [X0,X1,X2] :
( ( ~ empty(X1)
& preboolean(X1) )
=> ( ( element(X0,X1)
& element(X2,X1) )
=> element(set_intersection2(X0,X2),X1) ) ),
inference(rectify,[],[f27]) ).
fof(f27,negated_conjecture,
~ ! [X0,X2,X1] :
( ( ~ empty(X2)
& preboolean(X2) )
=> ( ( element(X1,X2)
& element(X0,X2) )
=> element(set_intersection2(X0,X1),X2) ) ),
inference(negated_conjecture,[],[f26]) ).
fof(f26,conjecture,
! [X0,X2,X1] :
( ( ~ empty(X2)
& preboolean(X2) )
=> ( ( element(X1,X2)
& element(X0,X2) )
=> element(set_intersection2(X0,X1),X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_finsub_1) ).
fof(f321,plain,
( ~ element(sK8,sK6)
| element(set_difference(sK8,sK7),sK6) ),
inference(subsumption_resolution,[],[f320,f160]) ).
fof(f160,plain,
element(sK7,sK6),
inference(cnf_transformation,[],[f106]) ).
fof(f320,plain,
( ~ element(sK7,sK6)
| ~ element(sK8,sK6)
| element(set_difference(sK8,sK7),sK6) ),
inference(superposition,[],[f263,f286]) ).
fof(f286,plain,
prebool_difference(sK6,sK8,sK7) = set_difference(sK8,sK7),
inference(resolution,[],[f272,f160]) ).
fof(f272,plain,
! [X0] :
( ~ element(X0,sK6)
| prebool_difference(sK6,sK8,X0) = set_difference(sK8,X0) ),
inference(resolution,[],[f267,f159]) ).
fof(f267,plain,
! [X0,X1] :
( ~ element(X1,sK6)
| ~ element(X0,sK6)
| set_difference(X1,X0) = prebool_difference(sK6,X1,X0) ),
inference(subsumption_resolution,[],[f265,f157]) ).
fof(f157,plain,
~ empty(sK6),
inference(cnf_transformation,[],[f106]) ).
fof(f265,plain,
! [X0,X1] :
( ~ element(X1,sK6)
| empty(sK6)
| ~ element(X0,sK6)
| set_difference(X1,X0) = prebool_difference(sK6,X1,X0) ),
inference(resolution,[],[f162,f158]) ).
fof(f158,plain,
preboolean(sK6),
inference(cnf_transformation,[],[f106]) ).
fof(f162,plain,
! [X2,X0,X1] :
( ~ preboolean(X0)
| ~ element(X2,X0)
| ~ element(X1,X0)
| prebool_difference(X0,X1,X2) = set_difference(X1,X2)
| empty(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0,X1,X2] :
( ~ preboolean(X0)
| ~ element(X1,X0)
| empty(X0)
| ~ element(X2,X0)
| prebool_difference(X0,X1,X2) = set_difference(X1,X2) ),
inference(rectify,[],[f64]) ).
fof(f64,plain,
! [X2,X1,X0] :
( ~ preboolean(X2)
| ~ element(X1,X2)
| empty(X2)
| ~ element(X0,X2)
| set_difference(X1,X0) = prebool_difference(X2,X1,X0) ),
inference(flattening,[],[f63]) ).
fof(f63,plain,
! [X2,X0,X1] :
( set_difference(X1,X0) = prebool_difference(X2,X1,X0)
| ~ element(X1,X2)
| ~ preboolean(X2)
| empty(X2)
| ~ element(X0,X2) ),
inference(ennf_transformation,[],[f40]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ( element(X1,X2)
& preboolean(X2)
& ~ empty(X2)
& element(X0,X2) )
=> set_difference(X1,X0) = prebool_difference(X2,X1,X0) ),
inference(rectify,[],[f24]) ).
fof(f24,axiom,
! [X2,X1,X0] :
( ( preboolean(X0)
& element(X1,X0)
& element(X2,X0)
& ~ empty(X0) )
=> prebool_difference(X0,X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k2_finsub_1) ).
fof(f263,plain,
! [X0,X1] :
( element(prebool_difference(sK6,X0,X1),sK6)
| ~ element(X0,sK6)
| ~ element(X1,sK6) ),
inference(subsumption_resolution,[],[f261,f157]) ).
fof(f261,plain,
! [X0,X1] :
( ~ element(X1,sK6)
| empty(sK6)
| element(prebool_difference(sK6,X0,X1),sK6)
| ~ element(X0,sK6) ),
inference(resolution,[],[f137,f158]) ).
fof(f137,plain,
! [X2,X0,X1] :
( ~ preboolean(X2)
| element(prebool_difference(X2,X0,X1),X2)
| empty(X2)
| ~ element(X1,X2)
| ~ element(X0,X2) ),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
! [X0,X1,X2] :
( ~ preboolean(X2)
| empty(X2)
| ~ element(X1,X2)
| element(prebool_difference(X2,X0,X1),X2)
| ~ element(X0,X2) ),
inference(rectify,[],[f76]) ).
fof(f76,plain,
! [X1,X0,X2] :
( ~ preboolean(X2)
| empty(X2)
| ~ element(X0,X2)
| element(prebool_difference(X2,X1,X0),X2)
| ~ element(X1,X2) ),
inference(flattening,[],[f75]) ).
fof(f75,plain,
! [X2,X1,X0] :
( element(prebool_difference(X2,X1,X0),X2)
| ~ preboolean(X2)
| ~ element(X1,X2)
| empty(X2)
| ~ element(X0,X2) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,plain,
! [X2,X1,X0] :
( ( preboolean(X2)
& element(X1,X2)
& ~ empty(X2)
& element(X0,X2) )
=> element(prebool_difference(X2,X1,X0),X2) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X2,X1,X0] :
( ( preboolean(X0)
& element(X1,X0)
& ~ empty(X0)
& element(X2,X0) )
=> element(prebool_difference(X0,X1,X2),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_finsub_1) ).
fof(f421,plain,
~ element(set_difference(sK8,sK7),sK6),
inference(subsumption_resolution,[],[f420,f159]) ).
fof(f420,plain,
( ~ element(sK8,sK6)
| ~ element(set_difference(sK8,sK7),sK6) ),
inference(subsumption_resolution,[],[f419,f180]) ).
fof(f180,plain,
~ element(sF13,sK6),
inference(definition_folding,[],[f161,f179]) ).
fof(f179,plain,
sF13 = set_intersection2(sK8,sK7),
introduced(function_definition,[]) ).
fof(f161,plain,
~ element(set_intersection2(sK8,sK7),sK6),
inference(cnf_transformation,[],[f106]) ).
fof(f419,plain,
( element(sF13,sK6)
| ~ element(sK8,sK6)
| ~ element(set_difference(sK8,sK7),sK6) ),
inference(superposition,[],[f263,f332]) ).
fof(f332,plain,
sF13 = prebool_difference(sK6,sK8,set_difference(sK8,sK7)),
inference(forward_demodulation,[],[f331,f213]) ).
fof(f213,plain,
sF13 = set_intersection2(sK7,sK8),
inference(superposition,[],[f179,f172]) ).
fof(f172,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1,X0] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f331,plain,
prebool_difference(sK6,sK8,set_difference(sK8,sK7)) = set_intersection2(sK7,sK8),
inference(forward_demodulation,[],[f330,f172]) ).
fof(f330,plain,
prebool_difference(sK6,sK8,set_difference(sK8,sK7)) = set_intersection2(sK8,sK7),
inference(forward_demodulation,[],[f327,f140]) ).
fof(f140,plain,
! [X0,X1] : set_intersection2(X1,X0) = set_difference(X1,set_difference(X1,X0)),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
! [X0,X1] : set_intersection2(X1,X0) = set_difference(X1,set_difference(X1,X0)),
inference(rectify,[],[f33]) ).
fof(f33,axiom,
! [X1,X0] : set_intersection2(X0,X1) = set_difference(X0,set_difference(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t48_xboole_1) ).
fof(f327,plain,
set_difference(sK8,set_difference(sK8,sK7)) = prebool_difference(sK6,sK8,set_difference(sK8,sK7)),
inference(resolution,[],[f322,f272]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU102+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/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 : n007.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 14:23:16 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.49 % (27038)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)
% 0.20/0.49 % (27046)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.51 % (27032)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (27038)First to succeed.
% 0.20/0.52 % (27026)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (27030)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52 % (27024)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52 % (27025)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.20/0.53 % (27038)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (27038)------------------------------
% 0.20/0.53 % (27038)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (27038)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (27038)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (27038)Memory used [KB]: 1151
% 0.20/0.53 % (27038)Time elapsed: 0.102 s
% 0.20/0.53 % (27038)Instructions burned: 14 (million)
% 0.20/0.53 % (27038)------------------------------
% 0.20/0.53 % (27038)------------------------------
% 0.20/0.53 % (27022)Success in time 0.171 s
%------------------------------------------------------------------------------