TSTP Solution File: SET704+4 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET704+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 : n005.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:56 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 80 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 80 ( 29 ~; 17 |; 17 &)
% ( 5 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 60 ( 50 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f44,plain,
$false,
inference(subsumption_resolution,[],[f42,f39]) ).
fof(f39,plain,
member(sK3(product(sK0),sK1),product(sK0)),
inference(unit_resulting_resolution,[],[f30,f36]) ).
fof(f36,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK3(X0,X1),X0) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( ( member(sK3(X0,X1),X0)
& ~ member(sK3(X0,X1),X1) )
| subset(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f27,f28]) ).
fof(f28,plain,
! [X0,X1] :
( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
=> ( member(sK3(X0,X1),X0)
& ~ member(sK3(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X0,X1] :
( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subset(X0,X1) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X1,X0] :
( ? [X2] :
( member(X2,X1)
& ~ member(X2,X0) )
| subset(X1,X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
! [X1,X0] :
( ! [X2] :
( member(X2,X1)
=> member(X2,X0) )
=> subset(X1,X0) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f15,plain,
! [X1,X0] :
( subset(X1,X0)
<=> ! [X2] :
( member(X2,X1)
=> member(X2,X0) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f30,plain,
~ subset(product(sK0),sK1),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
( member(sK1,sK0)
& ~ subset(product(sK0),sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f20,f21]) ).
fof(f21,plain,
( ? [X0,X1] :
( member(X1,X0)
& ~ subset(product(X0),X1) )
=> ( member(sK1,sK0)
& ~ subset(product(sK0),sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1] :
( member(X1,X0)
& ~ subset(product(X0),X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X0,X1] :
( member(X1,X0)
=> subset(product(X0),X1) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X2] :
( member(X2,X0)
=> subset(product(X0),X2) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X2] :
( member(X2,X0)
=> subset(product(X0),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI42) ).
fof(f42,plain,
~ member(sK3(product(sK0),sK1),product(sK0)),
inference(unit_resulting_resolution,[],[f31,f38,f32]) ).
fof(f32,plain,
! [X3,X0,X1] :
( ~ member(X0,product(X1))
| ~ member(X3,X1)
| member(X0,X3) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( ( member(X0,product(X1))
| ( ~ member(X0,sK2(X0,X1))
& member(sK2(X0,X1),X1) ) )
& ( ! [X3] :
( member(X0,X3)
| ~ member(X3,X1) )
| ~ member(X0,product(X1)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f24,f25]) ).
fof(f25,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X0,X2)
& member(X2,X1) )
=> ( ~ member(X0,sK2(X0,X1))
& member(sK2(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X0,X1] :
( ( member(X0,product(X1))
| ? [X2] :
( ~ member(X0,X2)
& member(X2,X1) ) )
& ( ! [X3] :
( member(X0,X3)
| ~ member(X3,X1) )
| ~ member(X0,product(X1)) ) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X1,X0] :
( ( member(X1,product(X0))
| ? [X2] :
( ~ member(X1,X2)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X1,X2)
| ~ member(X2,X0) )
| ~ member(X1,product(X0)) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X1,X0] :
( member(X1,product(X0))
<=> ! [X2] :
( member(X1,X2)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> member(X1,X2) )
<=> member(X1,product(X0)) ),
inference(rectify,[],[f11]) ).
fof(f11,axiom,
! [X0,X2] :
( member(X2,product(X0))
<=> ! [X4] :
( member(X4,X0)
=> member(X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product) ).
fof(f38,plain,
~ member(sK3(product(sK0),sK1),sK1),
inference(unit_resulting_resolution,[],[f30,f35]) ).
fof(f35,plain,
! [X0,X1] :
( ~ member(sK3(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f31,plain,
member(sK1,sK0),
inference(cnf_transformation,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET704+4 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13 % 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.34 % Computer : n005.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 14:51:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (26790)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.50 % (26782)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.50 % (26791)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (26779)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.51 % (26798)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.51 % (26790)Instruction limit reached!
% 0.20/0.51 % (26790)------------------------------
% 0.20/0.51 % (26790)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (26799)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (26782)First to succeed.
% 0.20/0.51 % (26783)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.52 % (26782)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (26782)------------------------------
% 0.20/0.52 % (26782)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (26782)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (26782)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (26782)Memory used [KB]: 5884
% 0.20/0.52 % (26782)Time elapsed: 0.111 s
% 0.20/0.52 % (26782)Instructions burned: 2 (million)
% 0.20/0.52 % (26782)------------------------------
% 0.20/0.52 % (26782)------------------------------
% 0.20/0.52 % (26774)Success in time 0.167 s
%------------------------------------------------------------------------------