TSTP Solution File: SET020+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET020+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 : n025.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:18:27 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 88 ( 51 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 91 ( 31 ~; 20 |; 34 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 25 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f122,plain,
$false,
inference(subsumption_resolution,[],[f121,f92]) ).
fof(f92,plain,
sK2 = first(sK1),
inference(forward_demodulation,[],[f89,f69]) ).
fof(f69,plain,
ordered_pair(sK2,sK0) = sK1,
inference(cnf_transformation,[],[f62]) ).
fof(f62,plain,
( member(sK0,universal_class)
& ( sK2 != first(sK1)
| sK0 != second(sK1) )
& member(sK2,universal_class)
& ordered_pair(sK2,sK0) = sK1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f60,f61]) ).
fof(f61,plain,
( ? [X0,X1,X2] :
( member(X0,universal_class)
& ( first(X1) != X2
| second(X1) != X0 )
& member(X2,universal_class)
& ordered_pair(X2,X0) = X1 )
=> ( member(sK0,universal_class)
& ( sK2 != first(sK1)
| sK0 != second(sK1) )
& member(sK2,universal_class)
& ordered_pair(sK2,sK0) = sK1 ) ),
introduced(choice_axiom,[]) ).
fof(f60,plain,
? [X0,X1,X2] :
( member(X0,universal_class)
& ( first(X1) != X2
| second(X1) != X0 )
& member(X2,universal_class)
& ordered_pair(X2,X0) = X1 ),
inference(rectify,[],[f54]) ).
fof(f54,plain,
? [X1,X0,X2] :
( member(X1,universal_class)
& ( first(X0) != X2
| second(X0) != X1 )
& member(X2,universal_class)
& ordered_pair(X2,X1) = X0 ),
inference(flattening,[],[f53]) ).
fof(f53,plain,
? [X1,X0,X2] :
( ( first(X0) != X2
| second(X0) != X1 )
& member(X2,universal_class)
& member(X1,universal_class)
& ordered_pair(X2,X1) = X0 ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,plain,
~ ! [X1,X0,X2] :
( ( member(X2,universal_class)
& member(X1,universal_class)
& ordered_pair(X2,X1) = X0 )
=> ( first(X0) = X2
& second(X0) = X1 ) ),
inference(rectify,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X0,X3,X2] :
( ( member(X3,universal_class)
& ordered_pair(X2,X3) = X0
& member(X2,universal_class) )
=> ( first(X0) = X2
& second(X0) = X3 ) ),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X0,X3,X2] :
( ( member(X3,universal_class)
& ordered_pair(X2,X3) = X0
& member(X2,universal_class) )
=> ( first(X0) = X2
& second(X0) = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unique_1st_and_2nd_in_pair_of_sets1) ).
fof(f89,plain,
sK2 = first(ordered_pair(sK2,sK0)),
inference(resolution,[],[f75,f70]) ).
fof(f70,plain,
member(sK2,universal_class),
inference(cnf_transformation,[],[f62]) ).
fof(f75,plain,
! [X0] :
( ~ member(X0,universal_class)
| first(ordered_pair(X0,sK0)) = X0 ),
inference(resolution,[],[f72,f67]) ).
fof(f67,plain,
! [X0,X1] :
( ~ member(X1,universal_class)
| first(ordered_pair(X0,X1)) = X0
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f58]) ).
fof(f58,plain,
! [X0,X1] :
( ~ member(X0,universal_class)
| ~ member(X1,universal_class)
| ( first(ordered_pair(X0,X1)) = X0
& second(ordered_pair(X0,X1)) = X1 ) ),
inference(rectify,[],[f51]) ).
fof(f51,plain,
! [X1,X0] :
( ~ member(X1,universal_class)
| ~ member(X0,universal_class)
| ( first(ordered_pair(X1,X0)) = X1
& second(ordered_pair(X1,X0)) = X0 ) ),
inference(flattening,[],[f50]) ).
fof(f50,plain,
! [X0,X1] :
( ( first(ordered_pair(X1,X0)) = X1
& second(ordered_pair(X1,X0)) = X0 )
| ~ member(X0,universal_class)
| ~ member(X1,universal_class) ),
inference(ennf_transformation,[],[f48]) ).
fof(f48,plain,
! [X0,X1] :
( ( member(X0,universal_class)
& member(X1,universal_class) )
=> ( first(ordered_pair(X1,X0)) = X1
& second(ordered_pair(X1,X0)) = X0 ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1,X0] :
( ( member(X0,universal_class)
& member(X1,universal_class) )
=> ( second(ordered_pair(X0,X1)) = X1
& first(ordered_pair(X0,X1)) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',first_second) ).
fof(f72,plain,
member(sK0,universal_class),
inference(cnf_transformation,[],[f62]) ).
fof(f121,plain,
sK2 != first(sK1),
inference(trivial_inequality_removal,[],[f120]) ).
fof(f120,plain,
( sK2 != first(sK1)
| sK0 != sK0 ),
inference(backward_demodulation,[],[f71,f98]) ).
fof(f98,plain,
sK0 = second(sK1),
inference(forward_demodulation,[],[f94,f69]) ).
fof(f94,plain,
sK0 = second(ordered_pair(sK2,sK0)),
inference(resolution,[],[f76,f70]) ).
fof(f76,plain,
! [X1] :
( ~ member(X1,universal_class)
| sK0 = second(ordered_pair(X1,sK0)) ),
inference(resolution,[],[f72,f66]) ).
fof(f66,plain,
! [X0,X1] :
( ~ member(X1,universal_class)
| ~ member(X0,universal_class)
| second(ordered_pair(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f58]) ).
fof(f71,plain,
( sK2 != first(sK1)
| sK0 != second(sK1) ),
inference(cnf_transformation,[],[f62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET020+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/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.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 13:04:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.49 % (32307)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.20/0.49 % (32299)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.49 % (32299)First to succeed.
% 0.20/0.49 % (32299)Refutation found. Thanks to Tanya!
% 0.20/0.49 % SZS status Theorem for theBenchmark
% 0.20/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.49 % (32299)------------------------------
% 0.20/0.49 % (32299)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (32299)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (32299)Termination reason: Refutation
% 0.20/0.49
% 0.20/0.49 % (32299)Memory used [KB]: 1535
% 0.20/0.49 % (32299)Time elapsed: 0.088 s
% 0.20/0.49 % (32299)Instructions burned: 3 (million)
% 0.20/0.49 % (32299)------------------------------
% 0.20/0.49 % (32299)------------------------------
% 0.20/0.49 % (32292)Success in time 0.146 s
%------------------------------------------------------------------------------