TSTP Solution File: SET102+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET102+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 : n015.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:14 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 17 unt; 0 def)
% Number of atoms : 56 ( 23 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 53 ( 22 ~; 17 |; 11 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 42 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f84,plain,
$false,
inference(unit_resulting_resolution,[],[f67,f72,f77]) ).
fof(f77,plain,
! [X2,X0] :
( member(X2,unordered_pair(X0,X2))
| ~ member(X2,universal_class) ),
inference(equality_resolution,[],[f62]) ).
fof(f62,plain,
! [X2,X0,X1] :
( member(X1,unordered_pair(X0,X2))
| X1 != X2
| ~ member(X1,universal_class) ),
inference(cnf_transformation,[],[f53]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ( ( ( X0 = X1
| X1 = X2 )
& member(X1,universal_class) )
| ~ member(X1,unordered_pair(X0,X2)) )
& ( member(X1,unordered_pair(X0,X2))
| ( X0 != X1
& X1 != X2 )
| ~ member(X1,universal_class) ) ),
inference(rectify,[],[f52]) ).
fof(f52,plain,
! [X2,X0,X1] :
( ( ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X2,X1)) )
& ( member(X0,unordered_pair(X2,X1))
| ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class) ) ),
inference(flattening,[],[f51]) ).
fof(f51,plain,
! [X2,X0,X1] :
( ( ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X2,X1)) )
& ( member(X0,unordered_pair(X2,X1))
| ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X2,X0,X1] :
( ( ( X0 = X2
| X0 = X1 )
& 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))
<=> ( ( X1 = X2
| X0 = X2 )
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_defn) ).
fof(f72,plain,
~ member(unordered_pair(sK0,unordered_pair(sK1,sK1)),unordered_pair(unordered_pair(sK0,sK0),unordered_pair(sK0,unordered_pair(sK1,sK1)))),
inference(definition_unfolding,[],[f66,f60,f71]) ).
fof(f71,plain,
! [X0,X1] : unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X0,X0))) = ordered_pair(X1,X0),
inference(definition_unfolding,[],[f61,f60,f60]) ).
fof(f61,plain,
! [X0,X1] : unordered_pair(singleton(X1),unordered_pair(X1,singleton(X0))) = ordered_pair(X1,X0),
inference(cnf_transformation,[],[f50]) ).
fof(f50,plain,
! [X0,X1] : unordered_pair(singleton(X1),unordered_pair(X1,singleton(X0))) = ordered_pair(X1,X0),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_defn) ).
fof(f60,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_set_defn) ).
fof(f66,plain,
~ member(unordered_pair(sK0,singleton(sK1)),ordered_pair(sK0,sK1)),
inference(cnf_transformation,[],[f55]) ).
fof(f55,plain,
~ member(unordered_pair(sK0,singleton(sK1)),ordered_pair(sK0,sK1)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f49,f54]) ).
fof(f54,plain,
( ? [X0,X1] : ~ member(unordered_pair(X0,singleton(X1)),ordered_pair(X0,X1))
=> ~ member(unordered_pair(sK0,singleton(sK1)),ordered_pair(sK0,sK1)) ),
introduced(choice_axiom,[]) ).
fof(f49,plain,
? [X0,X1] : ~ member(unordered_pair(X0,singleton(X1)),ordered_pair(X0,X1)),
inference(ennf_transformation,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] : member(unordered_pair(X0,singleton(X1)),ordered_pair(X0,X1)),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X0,X1] : member(unordered_pair(X0,singleton(X1)),ordered_pair(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_member_of_ordered_pair) ).
fof(f67,plain,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
inference(rectify,[],[f48]) ).
fof(f48,plain,
! [X1,X0] : member(unordered_pair(X1,X0),universal_class),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X0] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET102+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.34 % Computer : n015.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 18:47:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.49 % (9829)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.50 % (9845)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.19/0.50 % (9826)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.19/0.51 % (9837)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.19/0.51 % (9829)First to succeed.
% 0.19/0.51 % (9830)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.51 % (9827)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.51 % (9829)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (9829)------------------------------
% 0.19/0.51 % (9829)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (9829)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (9829)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (9829)Memory used [KB]: 6012
% 0.19/0.51 % (9829)Time elapsed: 0.103 s
% 0.19/0.51 % (9829)Instructions burned: 2 (million)
% 0.19/0.51 % (9829)------------------------------
% 0.19/0.51 % (9829)------------------------------
% 0.19/0.51 % (9817)Success in time 0.164 s
%------------------------------------------------------------------------------