TSTP Solution File: SET907+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET907+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_uns --cores 0 -t %d %s
% Computer : n006.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:22:42 EDT 2022
% Result : Theorem 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 10 unt; 0 def)
% Number of atoms : 67 ( 17 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 65 ( 24 ~; 13 |; 22 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 36 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f70,plain,
$false,
inference(subsumption_resolution,[],[f67,f63]) ).
fof(f63,plain,
subset(unordered_pair(sK1,sK3),sK2),
inference(unit_resulting_resolution,[],[f38,f40,f45]) ).
fof(f45,plain,
! [X2,X0,X1] :
( subset(unordered_pair(X1,X2),X0)
| ~ in(X1,X0)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X1,X2),X0)
| ~ in(X1,X0)
| ~ in(X2,X0) )
& ( ( in(X1,X0)
& in(X2,X0) )
| ~ subset(unordered_pair(X1,X2),X0) ) ),
inference(rectify,[],[f31]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X0,X2)
| ~ in(X1,X2) )
& ( ( in(X0,X2)
& in(X1,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X0,X2)
| ~ in(X1,X2) )
& ( ( in(X0,X2)
& in(X1,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X2,X0,X1] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X0,X2)
& in(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f40,plain,
in(sK1,sK2),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
( in(sK1,sK2)
& sK2 != set_union2(unordered_pair(sK3,sK1),sK2)
& in(sK3,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f27,f28]) ).
fof(f28,plain,
( ? [X0,X1,X2] :
( in(X0,X1)
& set_union2(unordered_pair(X2,X0),X1) != X1
& in(X2,X1) )
=> ( in(sK1,sK2)
& sK2 != set_union2(unordered_pair(sK3,sK1),sK2)
& in(sK3,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
? [X0,X1,X2] :
( in(X0,X1)
& set_union2(unordered_pair(X2,X0),X1) != X1
& in(X2,X1) ),
inference(rectify,[],[f24]) ).
fof(f24,plain,
? [X1,X0,X2] :
( in(X1,X0)
& set_union2(unordered_pair(X2,X1),X0) != X0
& in(X2,X0) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
? [X1,X0,X2] :
( set_union2(unordered_pair(X2,X1),X0) != X0
& in(X1,X0)
& in(X2,X0) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
~ ! [X1,X0,X2] :
( ( in(X1,X0)
& in(X2,X0) )
=> set_union2(unordered_pair(X2,X1),X0) = X0 ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X1,X2,X0] :
( ( in(X2,X1)
& in(X0,X1) )
=> set_union2(unordered_pair(X0,X2),X1) = X1 ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X1,X2,X0] :
( ( in(X2,X1)
& in(X0,X1) )
=> set_union2(unordered_pair(X0,X2),X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t48_zfmisc_1) ).
fof(f38,plain,
in(sK3,sK2),
inference(cnf_transformation,[],[f29]) ).
fof(f67,plain,
~ subset(unordered_pair(sK1,sK3),sK2),
inference(unit_resulting_resolution,[],[f53,f50]) ).
fof(f50,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f53,plain,
set_union2(unordered_pair(sK1,sK3),sK2) != sK2,
inference(forward_demodulation,[],[f39,f41]) ).
fof(f41,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f39,plain,
sK2 != set_union2(unordered_pair(sK3,sK1),sK2),
inference(cnf_transformation,[],[f29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SET907+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % 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.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 14:37:55 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.47 % (29322)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.19/0.47 % (29306)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.19/0.47 % (29314)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.47 % (29314)First to succeed.
% 0.19/0.47 % (29314)Refutation found. Thanks to Tanya!
% 0.19/0.47 % SZS status Theorem for theBenchmark
% 0.19/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47 % (29314)------------------------------
% 0.19/0.47 % (29314)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47 % (29314)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47 % (29314)Termination reason: Refutation
% 0.19/0.47
% 0.19/0.47 % (29314)Memory used [KB]: 5884
% 0.19/0.47 % (29314)Time elapsed: 0.092 s
% 0.19/0.47 % (29314)Instructions burned: 2 (million)
% 0.19/0.47 % (29314)------------------------------
% 0.19/0.47 % (29314)------------------------------
% 0.19/0.47 % (29292)Success in time 0.133 s
%------------------------------------------------------------------------------