TSTP Solution File: SET108+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET108+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_uns --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:19:17 EDT 2022
% Result : Theorem 0.20s 0.54s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 98 ( 48 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 124 ( 48 ~; 37 |; 37 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 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 : 49 ( 24 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f72,plain,
$false,
inference(subsumption_resolution,[],[f71,f64]) ).
fof(f64,plain,
member(sK1,universal_class),
inference(equality_resolution,[],[f63]) ).
fof(f63,plain,
! [X2] :
( member(sK1,universal_class)
| sK0 != X2 ),
inference(equality_resolution,[],[f59]) ).
fof(f59,plain,
! [X2,X1] :
( member(sK1,universal_class)
| sK0 != X1
| sK0 != X2 ),
inference(cnf_transformation,[],[f52]) ).
fof(f52,plain,
! [X1,X2] :
( ( ( member(sK1,universal_class)
& member(sK2,universal_class)
& sK0 = ordered_pair(sK1,sK2) )
| sK0 != X1
| sK0 != X2 )
& ( ~ member(X2,universal_class)
| sK0 != ordered_pair(X1,X2)
| ~ member(X1,universal_class) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f49,f51,f50]) ).
fof(f50,plain,
( ? [X0] :
! [X1,X2] :
( ( ? [X3,X4] :
( member(X3,universal_class)
& member(X4,universal_class)
& ordered_pair(X3,X4) = X0 )
| X0 != X1
| X0 != X2 )
& ( ~ member(X2,universal_class)
| ordered_pair(X1,X2) != X0
| ~ member(X1,universal_class) ) )
=> ! [X2,X1] :
( ( ? [X4,X3] :
( member(X3,universal_class)
& member(X4,universal_class)
& sK0 = ordered_pair(X3,X4) )
| sK0 != X1
| sK0 != X2 )
& ( ~ member(X2,universal_class)
| sK0 != ordered_pair(X1,X2)
| ~ member(X1,universal_class) ) ) ),
introduced(choice_axiom,[]) ).
fof(f51,plain,
( ? [X4,X3] :
( member(X3,universal_class)
& member(X4,universal_class)
& sK0 = ordered_pair(X3,X4) )
=> ( member(sK1,universal_class)
& member(sK2,universal_class)
& sK0 = ordered_pair(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f49,plain,
? [X0] :
! [X1,X2] :
( ( ? [X3,X4] :
( member(X3,universal_class)
& member(X4,universal_class)
& ordered_pair(X3,X4) = X0 )
| X0 != X1
| X0 != X2 )
& ( ~ member(X2,universal_class)
| ordered_pair(X1,X2) != X0
| ~ member(X1,universal_class) ) ),
inference(rectify,[],[f48]) ).
fof(f48,plain,
? [X0] :
! [X1,X2] :
( ( ? [X4,X3] :
( member(X4,universal_class)
& member(X3,universal_class)
& ordered_pair(X4,X3) = X0 )
| X0 != X1
| X0 != X2 )
& ( ~ member(X2,universal_class)
| ordered_pair(X1,X2) != X0
| ~ member(X1,universal_class) ) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,plain,
~ ! [X0] :
? [X2,X1] :
( ( member(X2,universal_class)
& ordered_pair(X1,X2) = X0
& member(X1,universal_class) )
| ( ~ ? [X4,X3] :
( member(X4,universal_class)
& member(X3,universal_class)
& ordered_pair(X4,X3) = X0 )
& X0 = X1
& X0 = X2 ) ),
inference(rectify,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X0] :
? [X2,X3] :
( ( ~ ? [X4,X1] :
( ordered_pair(X1,X4) = X0
& member(X1,universal_class)
& member(X4,universal_class) )
& X0 = X2
& X0 = X3 )
| ( ordered_pair(X2,X3) = X0
& member(X3,universal_class)
& member(X2,universal_class) ) ),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X0] :
? [X2,X3] :
( ( ~ ? [X4,X1] :
( ordered_pair(X1,X4) = X0
& member(X1,universal_class)
& member(X4,universal_class) )
& X0 = X2
& X0 = X3 )
| ( ordered_pair(X2,X3) = X0
& member(X3,universal_class)
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_first_and_second) ).
fof(f71,plain,
~ member(sK1,universal_class),
inference(subsumption_resolution,[],[f70,f66]) ).
fof(f66,plain,
member(sK2,universal_class),
inference(equality_resolution,[],[f65]) ).
fof(f65,plain,
! [X2] :
( member(sK2,universal_class)
| sK0 != X2 ),
inference(equality_resolution,[],[f58]) ).
fof(f58,plain,
! [X2,X1] :
( member(sK2,universal_class)
| sK0 != X1
| sK0 != X2 ),
inference(cnf_transformation,[],[f52]) ).
fof(f70,plain,
( ~ member(sK2,universal_class)
| ~ member(sK1,universal_class) ),
inference(trivial_inequality_removal,[],[f69]) ).
fof(f69,plain,
( ~ member(sK1,universal_class)
| sK0 != sK0
| ~ member(sK2,universal_class) ),
inference(superposition,[],[f56,f68]) ).
fof(f68,plain,
sK0 = ordered_pair(sK1,sK2),
inference(equality_resolution,[],[f67]) ).
fof(f67,plain,
! [X2] :
( sK0 = ordered_pair(sK1,sK2)
| sK0 != X2 ),
inference(equality_resolution,[],[f57]) ).
fof(f57,plain,
! [X2,X1] :
( sK0 = ordered_pair(sK1,sK2)
| sK0 != X1
| sK0 != X2 ),
inference(cnf_transformation,[],[f52]) ).
fof(f56,plain,
! [X2,X1] :
( sK0 != ordered_pair(X1,X2)
| ~ member(X1,universal_class)
| ~ member(X2,universal_class) ),
inference(cnf_transformation,[],[f52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET108+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/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.35 % Computer : n011.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 13:15:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.53 % (2037)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.53 % (2037)First to succeed.
% 0.20/0.53 % (2054)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.54 % (2039)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.54 % (2045)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.54 % (2045)Instruction limit reached!
% 0.20/0.54 % (2045)------------------------------
% 0.20/0.54 % (2045)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (2045)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (2045)Termination reason: Unknown
% 0.20/0.54 % (2045)Termination phase: Property scanning
% 0.20/0.54
% 0.20/0.54 % (2045)Memory used [KB]: 1535
% 0.20/0.54 % (2045)Time elapsed: 0.003 s
% 0.20/0.54 % (2045)Instructions burned: 5 (million)
% 0.20/0.54 % (2045)------------------------------
% 0.20/0.54 % (2045)------------------------------
% 0.20/0.54 % (2038)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.54 % (2038)Also succeeded, but the first one will report.
% 0.20/0.54 % (2037)Refutation found. Thanks to Tanya!
% 0.20/0.54 % SZS status Theorem for theBenchmark
% 0.20/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.54 % (2037)------------------------------
% 0.20/0.54 % (2037)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (2037)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (2037)Termination reason: Refutation
% 0.20/0.54
% 0.20/0.54 % (2037)Memory used [KB]: 5884
% 0.20/0.54 % (2037)Time elapsed: 0.103 s
% 0.20/0.54 % (2037)Instructions burned: 2 (million)
% 0.20/0.54 % (2037)------------------------------
% 0.20/0.54 % (2037)------------------------------
% 0.20/0.54 % (2030)Success in time 0.178 s
%------------------------------------------------------------------------------