TSTP Solution File: SEU140+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU140+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 : n014.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:06 EDT 2022
% Result : Theorem 0.21s 0.59s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 9 unt; 0 def)
% Number of atoms : 66 ( 13 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 57 ( 21 ~; 11 |; 17 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 38 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f110,plain,
$false,
inference(subsumption_resolution,[],[f108,f78]) ).
fof(f78,plain,
empty_set != set_intersection2(sK3,sK4),
inference(resolution,[],[f54,f57]) ).
fof(f57,plain,
~ disjoint(sK3,sK4),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
( disjoint(sK2,sK4)
& subset(sK3,sK2)
& ~ disjoint(sK3,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f42,f43]) ).
fof(f43,plain,
( ? [X0,X1,X2] :
( disjoint(X0,X2)
& subset(X1,X0)
& ~ disjoint(X1,X2) )
=> ( disjoint(sK2,sK4)
& subset(sK3,sK2)
& ~ disjoint(sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
? [X0,X1,X2] :
( disjoint(X0,X2)
& subset(X1,X0)
& ~ disjoint(X1,X2) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
? [X2,X1,X0] :
( disjoint(X2,X0)
& subset(X1,X2)
& ~ disjoint(X1,X0) ),
inference(flattening,[],[f31]) ).
fof(f31,plain,
? [X1,X0,X2] :
( ~ disjoint(X1,X0)
& disjoint(X2,X0)
& subset(X1,X2) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,plain,
~ ! [X1,X0,X2] :
( ( disjoint(X2,X0)
& subset(X1,X2) )
=> disjoint(X1,X0) ),
inference(rectify,[],[f16]) ).
fof(f16,negated_conjecture,
~ ! [X2,X0,X1] :
( ( subset(X0,X1)
& disjoint(X1,X2) )
=> disjoint(X0,X2) ),
inference(negated_conjecture,[],[f15]) ).
fof(f15,conjecture,
! [X2,X0,X1] :
( ( subset(X0,X1)
& disjoint(X1,X2) )
=> disjoint(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t63_xboole_1) ).
fof(f54,plain,
! [X0,X1] :
( disjoint(X1,X0)
| set_intersection2(X1,X0) != empty_set ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1] :
( ( set_intersection2(X1,X0) = empty_set
| ~ disjoint(X1,X0) )
& ( disjoint(X1,X0)
| set_intersection2(X1,X0) != empty_set ) ),
inference(rectify,[],[f40]) ).
fof(f40,plain,
! [X1,X0] :
( ( set_intersection2(X0,X1) = empty_set
| ~ disjoint(X0,X1) )
& ( disjoint(X0,X1)
| set_intersection2(X0,X1) != empty_set ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( set_intersection2(X0,X1) = empty_set
<=> disjoint(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f108,plain,
empty_set = set_intersection2(sK3,sK4),
inference(resolution,[],[f90,f56]) ).
fof(f56,plain,
! [X0] :
( ~ subset(X0,empty_set)
| empty_set = X0 ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0] :
( empty_set = X0
| ~ subset(X0,empty_set) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,axiom,
! [X0] :
( subset(X0,empty_set)
=> empty_set = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(f90,plain,
subset(set_intersection2(sK3,sK4),empty_set),
inference(superposition,[],[f83,f80]) ).
fof(f80,plain,
empty_set = set_intersection2(sK2,sK4),
inference(resolution,[],[f55,f59]) ).
fof(f59,plain,
disjoint(sK2,sK4),
inference(cnf_transformation,[],[f44]) ).
fof(f55,plain,
! [X0,X1] :
( ~ disjoint(X1,X0)
| set_intersection2(X1,X0) = empty_set ),
inference(cnf_transformation,[],[f41]) ).
fof(f83,plain,
! [X0] : subset(set_intersection2(sK3,X0),set_intersection2(sK2,X0)),
inference(resolution,[],[f46,f58]) ).
fof(f58,plain,
subset(sK3,sK2),
inference(cnf_transformation,[],[f44]) ).
fof(f46,plain,
! [X2,X0,X1] :
( ~ subset(X2,X1)
| subset(set_intersection2(X2,X0),set_intersection2(X1,X0)) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1,X2] :
( subset(set_intersection2(X2,X0),set_intersection2(X1,X0))
| ~ subset(X2,X1) ),
inference(rectify,[],[f30]) ).
fof(f30,plain,
! [X1,X0,X2] :
( subset(set_intersection2(X2,X1),set_intersection2(X0,X1))
| ~ subset(X2,X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
! [X1,X2,X0] :
( subset(X2,X0)
=> subset(set_intersection2(X2,X1),set_intersection2(X0,X1)) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X1,X2,X0] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_xboole_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU140+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 14:44:33 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.57 % (20483)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.21/0.57 % (20475)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.21/0.58 % (20475)First to succeed.
% 0.21/0.58 % (20489)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.21/0.58 % (20465)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)
% 0.21/0.58 % (20467)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.58 % (20465)Also succeeded, but the first one will report.
% 0.21/0.59 % (20475)Refutation found. Thanks to Tanya!
% 0.21/0.59 % SZS status Theorem for theBenchmark
% 0.21/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.59 % (20475)------------------------------
% 0.21/0.59 % (20475)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.59 % (20475)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.59 % (20475)Termination reason: Refutation
% 0.21/0.59
% 0.21/0.59 % (20475)Memory used [KB]: 895
% 0.21/0.59 % (20475)Time elapsed: 0.085 s
% 0.21/0.59 % (20475)Instructions burned: 3 (million)
% 0.21/0.59 % (20475)------------------------------
% 0.21/0.59 % (20475)------------------------------
% 0.21/0.59 % (20459)Success in time 0.228 s
%------------------------------------------------------------------------------