TSTP Solution File: SET689+4 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET689+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n020.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:21:53 EDT 2022
% Result : Theorem 1.22s 0.52s
% Output : Refutation 1.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 10 unt; 0 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 97 ( 33 ~; 20 |; 34 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 58 ( 43 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,plain,
$false,
inference(subsumption_resolution,[],[f39,f40]) ).
fof(f40,plain,
member(sK3(sK0,sK2),sK1),
inference(unit_resulting_resolution,[],[f30,f37,f35]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ member(X2,X0)
| member(X2,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ( member(sK3(X0,X1),X0)
& ~ member(sK3(X0,X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f25,f26]) ).
fof(f26,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X0)
& ~ member(X3,X1) )
=> ( member(sK3(X0,X1),X0)
& ~ member(sK3(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X3] :
( member(X3,X0)
& ~ member(X3,X1) ) ) ),
inference(rectify,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) ) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) )
<=> subset(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f37,plain,
member(sK3(sK0,sK2),sK0),
inference(unit_resulting_resolution,[],[f36,f34]) ).
fof(f34,plain,
! [X0,X1] :
( member(sK3(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f36,plain,
~ subset(sK0,sK2),
inference(unit_resulting_resolution,[],[f31,f28,f32]) ).
fof(f32,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X1,X0] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X1,X0] :
( ( subset(X0,X1)
& subset(X1,X0) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( equal_set(X0,X1)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_set) ).
fof(f28,plain,
subset(sK2,sK0),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
( ~ equal_set(sK0,sK2)
& subset(sK0,sK1)
& subset(sK1,sK2)
& subset(sK2,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f21,f22]) ).
fof(f22,plain,
( ? [X0,X1,X2] :
( ~ equal_set(X0,X2)
& subset(X0,X1)
& subset(X1,X2)
& subset(X2,X0) )
=> ( ~ equal_set(sK0,sK2)
& subset(sK0,sK1)
& subset(sK1,sK2)
& subset(sK2,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
? [X0,X1,X2] :
( ~ equal_set(X0,X2)
& subset(X0,X1)
& subset(X1,X2)
& subset(X2,X0) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
? [X0,X2,X1] :
( ~ equal_set(X0,X1)
& subset(X0,X2)
& subset(X2,X1)
& subset(X1,X0) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
? [X0,X1,X2] :
( ~ equal_set(X0,X1)
& subset(X2,X1)
& subset(X1,X0)
& subset(X0,X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X1,X0)
& subset(X0,X2) )
=> equal_set(X0,X1) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X5,X1] :
( ( subset(X5,X0)
& subset(X0,X1)
& subset(X1,X5) )
=> equal_set(X0,X5) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X5,X1] :
( ( subset(X5,X0)
& subset(X0,X1)
& subset(X1,X5) )
=> equal_set(X0,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI05) ).
fof(f31,plain,
~ equal_set(sK0,sK2),
inference(cnf_transformation,[],[f23]) ).
fof(f30,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f23]) ).
fof(f39,plain,
~ member(sK3(sK0,sK2),sK1),
inference(unit_resulting_resolution,[],[f29,f38,f35]) ).
fof(f38,plain,
~ member(sK3(sK0,sK2),sK2),
inference(unit_resulting_resolution,[],[f36,f33]) ).
fof(f33,plain,
! [X0,X1] :
( ~ member(sK3(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f29,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET689+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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:16:30 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.51 % (31674)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.51 % (31682)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (31674)Refutation not found, incomplete strategy% (31674)------------------------------
% 0.20/0.51 % (31674)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (31674)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (31674)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.51
% 0.20/0.51 % (31674)Memory used [KB]: 1407
% 0.20/0.51 % (31674)Time elapsed: 0.104 s
% 0.20/0.51 % (31674)Instructions burned: 1 (million)
% 0.20/0.51 % (31674)------------------------------
% 0.20/0.51 % (31674)------------------------------
% 1.22/0.51 % (31682)First to succeed.
% 1.22/0.51 % (31681)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 1.22/0.52 % (31682)Refutation found. Thanks to Tanya!
% 1.22/0.52 % SZS status Theorem for theBenchmark
% 1.22/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 1.22/0.52 % (31682)------------------------------
% 1.22/0.52 % (31682)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.22/0.52 % (31682)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.22/0.52 % (31682)Termination reason: Refutation
% 1.22/0.52
% 1.22/0.52 % (31682)Memory used [KB]: 5884
% 1.22/0.52 % (31682)Time elapsed: 0.113 s
% 1.22/0.52 % (31682)Instructions burned: 2 (million)
% 1.22/0.52 % (31682)------------------------------
% 1.22/0.52 % (31682)------------------------------
% 1.22/0.52 % (31666)Success in time 0.158 s
%------------------------------------------------------------------------------