TSTP Solution File: SET017+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET017+1 : TPTP v8.1.0. Bugfixed v5.4.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 : n011.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:23:08 EDT 2022
% Result : Theorem 1.29s 0.52s
% Output : Refutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 94 ( 47 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 91 ( 27 ~; 23 |; 35 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 36 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f330,plain,
$false,
inference(subsumption_resolution,[],[f329,f189]) ).
fof(f189,plain,
sK4 != sK5,
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
( unordered_pair(sK3,sK5) = unordered_pair(sK3,sK4)
& member(sK4,universal_class)
& member(sK5,universal_class)
& sK4 != sK5 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f115,f116]) ).
fof(f116,plain,
( ? [X0,X1,X2] :
( unordered_pair(X0,X1) = unordered_pair(X0,X2)
& member(X1,universal_class)
& member(X2,universal_class)
& X1 != X2 )
=> ( unordered_pair(sK3,sK5) = unordered_pair(sK3,sK4)
& member(sK4,universal_class)
& member(sK5,universal_class)
& sK4 != sK5 ) ),
introduced(choice_axiom,[]) ).
fof(f115,plain,
? [X0,X1,X2] :
( unordered_pair(X0,X1) = unordered_pair(X0,X2)
& member(X1,universal_class)
& member(X2,universal_class)
& X1 != X2 ),
inference(rectify,[],[f87]) ).
fof(f87,plain,
? [X1,X0,X2] :
( unordered_pair(X1,X0) = unordered_pair(X1,X2)
& member(X0,universal_class)
& member(X2,universal_class)
& X0 != X2 ),
inference(flattening,[],[f86]) ).
fof(f86,plain,
? [X0,X2,X1] :
( X0 != X2
& unordered_pair(X1,X0) = unordered_pair(X1,X2)
& member(X2,universal_class)
& member(X0,universal_class) ),
inference(ennf_transformation,[],[f72]) ).
fof(f72,plain,
~ ! [X0,X2,X1] :
( ( unordered_pair(X1,X0) = unordered_pair(X1,X2)
& member(X2,universal_class)
& member(X0,universal_class) )
=> X0 = X2 ),
inference(rectify,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X4,X0,X1] :
( ( unordered_pair(X0,X1) = unordered_pair(X0,X4)
& member(X4,universal_class)
& member(X1,universal_class) )
=> X1 = X4 ),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X4,X0,X1] :
( ( unordered_pair(X0,X1) = unordered_pair(X0,X4)
& member(X4,universal_class)
& member(X1,universal_class) )
=> X1 = X4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_cancellation) ).
fof(f329,plain,
sK4 = sK5,
inference(resolution,[],[f327,f291]) ).
fof(f291,plain,
! [X1] : member(sK4,unordered_pair(X1,sK4)),
inference(resolution,[],[f283,f191]) ).
fof(f191,plain,
member(sK4,universal_class),
inference(cnf_transformation,[],[f117]) ).
fof(f283,plain,
! [X2,X0] :
( ~ member(X2,universal_class)
| member(X2,unordered_pair(X0,X2)) ),
inference(equality_resolution,[],[f169]) ).
fof(f169,plain,
! [X2,X0,X1] :
( member(X1,unordered_pair(X0,X2))
| X1 != X2
| ~ member(X1,universal_class) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0,X1,X2] :
( ( ( ( X1 = X2
| X0 = X1 )
& member(X1,universal_class) )
| ~ member(X1,unordered_pair(X0,X2)) )
& ( member(X1,unordered_pair(X0,X2))
| ( X1 != X2
& X0 != X1 )
| ~ member(X1,universal_class) ) ),
inference(rectify,[],[f100]) ).
fof(f100,plain,
! [X2,X0,X1] :
( ( ( ( X0 = X1
| X0 = X2 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X2,X1)) )
& ( member(X0,unordered_pair(X2,X1))
| ( X0 != X1
& X0 != X2 )
| ~ member(X0,universal_class) ) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
! [X2,X0,X1] :
( ( ( ( X0 = X1
| X0 = X2 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X2,X1)) )
& ( member(X0,unordered_pair(X2,X1))
| ( X0 != X1
& X0 != X2 )
| ~ member(X0,universal_class) ) ),
inference(nnf_transformation,[],[f46]) ).
fof(f46,plain,
! [X2,X0,X1] :
( ( ( X0 = X1
| X0 = X2 )
& member(X0,universal_class) )
<=> member(X0,unordered_pair(X2,X1)) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X2,X1,X0] :
( member(X2,unordered_pair(X0,X1))
<=> ( ( X0 = X2
| X1 = X2 )
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_defn) ).
fof(f327,plain,
! [X5] :
( ~ member(X5,unordered_pair(sK5,sK4))
| sK5 = X5 ),
inference(duplicate_literal_removal,[],[f324]) ).
fof(f324,plain,
! [X5] :
( ~ member(X5,unordered_pair(sK5,sK4))
| sK5 = X5
| sK5 = X5 ),
inference(superposition,[],[f171,f316]) ).
fof(f316,plain,
unordered_pair(sK5,sK4) = unordered_pair(sK5,sK5),
inference(superposition,[],[f192,f312]) ).
fof(f312,plain,
sK3 = sK5,
inference(subsumption_resolution,[],[f310,f189]) ).
fof(f310,plain,
( sK4 = sK5
| sK3 = sK5 ),
inference(resolution,[],[f297,f171]) ).
fof(f297,plain,
member(sK5,unordered_pair(sK3,sK4)),
inference(superposition,[],[f290,f192]) ).
fof(f290,plain,
! [X0] : member(sK5,unordered_pair(X0,sK5)),
inference(resolution,[],[f283,f190]) ).
fof(f190,plain,
member(sK5,universal_class),
inference(cnf_transformation,[],[f117]) ).
fof(f192,plain,
unordered_pair(sK3,sK5) = unordered_pair(sK3,sK4),
inference(cnf_transformation,[],[f117]) ).
fof(f171,plain,
! [X2,X0,X1] :
( ~ member(X1,unordered_pair(X0,X2))
| X0 = X1
| X1 = X2 ),
inference(cnf_transformation,[],[f101]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET017+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.06/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n011.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 12:51:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % (15793)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.51 % (15804)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.51 % (15793)First to succeed.
% 1.29/0.52 % (15820)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.29/0.52 % (15808)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.29/0.52 % (15796)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)
% 1.29/0.52 % (15799)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.29/0.52 % (15795)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.29/0.52 % (15799)Instruction limit reached!
% 1.29/0.52 % (15799)------------------------------
% 1.29/0.52 % (15799)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.29/0.52 % (15799)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.29/0.52 % (15799)Termination reason: Unknown
% 1.29/0.52 % (15799)Termination phase: Preprocessing 3
% 1.29/0.52
% 1.29/0.52 % (15799)Memory used [KB]: 1023
% 1.29/0.52 % (15799)Time elapsed: 0.002 s
% 1.29/0.52 % (15799)Instructions burned: 3 (million)
% 1.29/0.52 % (15799)------------------------------
% 1.29/0.52 % (15799)------------------------------
% 1.29/0.52 % (15793)Refutation found. Thanks to Tanya!
% 1.29/0.52 % SZS status Theorem for theBenchmark
% 1.29/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 1.29/0.52 % (15793)------------------------------
% 1.29/0.52 % (15793)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.29/0.52 % (15793)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.29/0.52 % (15793)Termination reason: Refutation
% 1.29/0.52
% 1.29/0.52 % (15793)Memory used [KB]: 1151
% 1.29/0.52 % (15793)Time elapsed: 0.124 s
% 1.29/0.52 % (15793)Instructions burned: 9 (million)
% 1.29/0.52 % (15793)------------------------------
% 1.29/0.52 % (15793)------------------------------
% 1.29/0.52 % (15789)Success in time 0.175 s
%------------------------------------------------------------------------------