TSTP Solution File: SET102-7 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET102-7 : TPTP v8.1.0. Bugfixed v2.1.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:14 EDT 2022
% Result : Unsatisfiable 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 18 ( 16 unt; 0 def)
% Number of atoms : 20 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 11 ( 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f327,plain,
$false,
inference(subsumption_resolution,[],[f326,f263]) ).
fof(f263,plain,
member(sF1,universal_class),
inference(superposition,[],[f11,f235]) ).
fof(f235,plain,
sF1 = unordered_pair(x,sF0),
introduced(function_definition,[]) ).
fof(f11,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pairs_in_universal) ).
fof(f326,plain,
~ member(sF1,universal_class),
inference(subsumption_resolution,[],[f315,f238]) ).
fof(f238,plain,
~ member(sF1,sF3),
inference(definition_folding,[],[f216,f237,f235,f234,f236,f235,f234]) ).
fof(f236,plain,
unordered_pair(x,x) = sF2,
introduced(function_definition,[]) ).
fof(f234,plain,
unordered_pair(y,y) = sF0,
introduced(function_definition,[]) ).
fof(f237,plain,
sF3 = unordered_pair(sF2,sF1),
introduced(function_definition,[]) ).
fof(f216,plain,
~ member(unordered_pair(x,unordered_pair(y,y)),unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y)))),
inference(definition_unfolding,[],[f146,f12,f156]) ).
fof(f156,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f13,f12,f12]) ).
fof(f13,axiom,
! [X0,X1] : unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))) = ordered_pair(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ordered_pair) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_set) ).
fof(f146,axiom,
~ member(unordered_pair(x,singleton(y)),ordered_pair(x,y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unordered_pair_member_of_ordered_pair_1) ).
fof(f315,plain,
( member(sF1,sF3)
| ~ member(sF1,universal_class) ),
inference(superposition,[],[f9,f277]) ).
fof(f277,plain,
unordered_pair(sF1,sF2) = sF3,
inference(superposition,[],[f108,f237]) ).
fof(f108,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_unordered_pair) ).
fof(f9,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET102-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/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 : 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 14:57:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 % (28030)lrs+10_1:1_kws=precedence:lwlo=on:tgt=ground:i=99966:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99966Mi)
% 0.19/0.47 % (28030)First to succeed.
% 0.19/0.48 % (28038)lrs+1011_1:1_atotf=0.0306256:ep=RST:mep=off:nm=0:sos=all:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.48 % (28038)Instruction limit reached!
% 0.19/0.48 % (28038)------------------------------
% 0.19/0.48 % (28038)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (28038)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (28038)Termination reason: Unknown
% 0.19/0.48 % (28038)Termination phase: Property scanning
% 0.19/0.48
% 0.19/0.48 % (28038)Memory used [KB]: 1407
% 0.19/0.48 % (28038)Time elapsed: 0.004 s
% 0.19/0.48 % (28038)Instructions burned: 4 (million)
% 0.19/0.48 % (28038)------------------------------
% 0.19/0.48 % (28038)------------------------------
% 0.19/0.49 % (28030)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (28030)------------------------------
% 0.19/0.49 % (28030)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (28030)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (28030)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (28030)Memory used [KB]: 6396
% 0.19/0.49 % (28030)Time elapsed: 0.083 s
% 0.19/0.49 % (28030)Instructions burned: 26 (million)
% 0.19/0.49 % (28030)------------------------------
% 0.19/0.49 % (28030)------------------------------
% 0.19/0.49 % (28028)Success in time 0.135 s
%------------------------------------------------------------------------------