TSTP Solution File: SET907+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -t %d %s
% Computer : n027.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:26:03 EDT 2022
% Result : Theorem 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 9 unt; 0 def)
% Number of atoms : 78 ( 22 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 75 ( 27 ~; 17 |; 23 &)
% ( 2 <=>; 6 =>; 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 : 58 ( 46 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f100,plain,
$false,
inference(subsumption_resolution,[],[f99,f66]) ).
fof(f66,plain,
sK4 != set_union2(sK4,unordered_pair(sK2,sK3)),
inference(superposition,[],[f54,f48]) ).
fof(f48,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f54,plain,
sK4 != set_union2(unordered_pair(sK2,sK3),sK4),
inference(cnf_transformation,[],[f40]) ).
fof(f40,plain,
( in(sK3,sK4)
& in(sK2,sK4)
& sK4 != set_union2(unordered_pair(sK2,sK3),sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f38,f39]) ).
fof(f39,plain,
( ? [X0,X1,X2] :
( in(X1,X2)
& in(X0,X2)
& set_union2(unordered_pair(X0,X1),X2) != X2 )
=> ( in(sK3,sK4)
& in(sK2,sK4)
& sK4 != set_union2(unordered_pair(sK2,sK3),sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
? [X0,X1,X2] :
( in(X1,X2)
& in(X0,X2)
& set_union2(unordered_pair(X0,X1),X2) != X2 ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
? [X1,X0,X2] :
( in(X0,X2)
& in(X1,X2)
& set_union2(unordered_pair(X1,X0),X2) != X2 ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
? [X1,X2,X0] :
( set_union2(unordered_pair(X1,X0),X2) != X2
& in(X0,X2)
& in(X1,X2) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
~ ! [X1,X2,X0] :
( ( in(X0,X2)
& in(X1,X2) )
=> set_union2(unordered_pair(X1,X0),X2) = X2 ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X2,X0,X1] :
( ( in(X0,X1)
& in(X2,X1) )
=> set_union2(unordered_pair(X0,X2),X1) = X1 ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X2,X0,X1] :
( ( in(X0,X1)
& in(X2,X1) )
=> set_union2(unordered_pair(X0,X2),X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t48_zfmisc_1) ).
fof(f99,plain,
sK4 = set_union2(sK4,unordered_pair(sK2,sK3)),
inference(resolution,[],[f94,f56]) ).
fof(f56,plain,
in(sK3,sK4),
inference(cnf_transformation,[],[f40]) ).
fof(f94,plain,
! [X0] :
( ~ in(X0,sK4)
| sK4 = set_union2(sK4,unordered_pair(sK2,X0)) ),
inference(forward_demodulation,[],[f90,f48]) ).
fof(f90,plain,
! [X0] :
( sK4 = set_union2(unordered_pair(sK2,X0),sK4)
| ~ in(X0,sK4) ),
inference(resolution,[],[f79,f55]) ).
fof(f55,plain,
in(sK2,sK4),
inference(cnf_transformation,[],[f40]) ).
fof(f79,plain,
! [X8,X6,X7] :
( ~ in(X8,X7)
| ~ in(X6,X7)
| set_union2(unordered_pair(X8,X6),X7) = X7 ),
inference(resolution,[],[f44,f53]) ).
fof(f53,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| set_union2(X1,X0) = X0 ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( set_union2(X1,X0) = X0
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( subset(X1,X0)
=> set_union2(X1,X0) = X0 ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X1,X0] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f44,plain,
! [X2,X0,X1] :
( subset(unordered_pair(X1,X2),X0)
| ~ in(X2,X0)
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( ( in(X2,X0)
& in(X1,X0) )
| ~ subset(unordered_pair(X1,X2),X0) )
& ( subset(unordered_pair(X1,X2),X0)
| ~ in(X2,X0)
| ~ in(X1,X0) ) ),
inference(rectify,[],[f30]) ).
fof(f30,plain,
! [X0,X2,X1] :
( ( ( in(X1,X0)
& in(X2,X0) )
| ~ subset(unordered_pair(X2,X1),X0) )
& ( subset(unordered_pair(X2,X1),X0)
| ~ in(X1,X0)
| ~ in(X2,X0) ) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
! [X0,X2,X1] :
( ( ( in(X1,X0)
& in(X2,X0) )
| ~ subset(unordered_pair(X2,X1),X0) )
& ( subset(unordered_pair(X2,X1),X0)
| ~ in(X1,X0)
| ~ in(X2,X0) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X2,X1] :
( ( in(X1,X0)
& in(X2,X0) )
<=> subset(unordered_pair(X2,X1),X0) ),
inference(rectify,[],[f11]) ).
fof(f11,axiom,
! [X2,X1,X0] :
( ( in(X0,X2)
& in(X1,X2) )
<=> subset(unordered_pair(X0,X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_zfmisc_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET907+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 14:53:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 % (12774)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.45 % (12751)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.19/0.45 % (12757)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.45 % (12757)First to succeed.
% 0.19/0.45 % (12757)Refutation found. Thanks to Tanya!
% 0.19/0.45 % SZS status Theorem for theBenchmark
% 0.19/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.46 % (12757)------------------------------
% 0.19/0.46 % (12757)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.46 % (12757)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.46 % (12757)Termination reason: Refutation
% 0.19/0.46
% 0.19/0.46 % (12757)Memory used [KB]: 5373
% 0.19/0.46 % (12757)Time elapsed: 0.069 s
% 0.19/0.46 % (12757)Instructions burned: 4 (million)
% 0.19/0.46 % (12757)------------------------------
% 0.19/0.46 % (12757)------------------------------
% 0.19/0.46 % (12749)Success in time 0.115 s
%------------------------------------------------------------------------------