TSTP Solution File: SET115-7 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET115-7 : TPTP v8.1.0. Bugfixed v7.3.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 : n020.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:21 EDT 2022
% Result : Unsatisfiable 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 13 ( 10 unt; 0 def)
% Number of atoms : 16 ( 15 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 3 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 11 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 12 ( 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f257,plain,
$false,
inference(global_subsumption,[],[f161,f256]) ).
fof(f256,plain,
x = first(x),
inference(trivial_inequality_removal,[],[f253]) ).
fof(f253,plain,
( x = first(x)
| x != x ),
inference(superposition,[],[f207,f239]) ).
fof(f239,plain,
! [X0] :
( complement(intersection(complement(singleton(singleton(first(X0)))),complement(singleton(complement(intersection(complement(singleton(first(X0))),complement(singleton(singleton(second(X0)))))))))) = X0
| first(X0) = X0 ),
inference(definition_unfolding,[],[f156,f163]) ).
fof(f163,plain,
! [X0,X1] : ordered_pair(X0,X1) = complement(intersection(complement(singleton(singleton(X0))),complement(singleton(complement(intersection(complement(singleton(X0)),complement(singleton(singleton(X1))))))))),
inference(definition_unfolding,[],[f13,f162,f162]) ).
fof(f162,plain,
! [X0,X1] : unordered_pair(X0,X1) = complement(intersection(complement(singleton(X0)),complement(singleton(X1)))),
inference(definition_unfolding,[],[f144,f26]) ).
fof(f26,axiom,
! [X0,X1] : complement(intersection(complement(X0),complement(X1))) = union(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union) ).
fof(f144,axiom,
! [X0,X1] : unordered_pair(X0,X1) = union(singleton(X0),singleton(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pairs_and_singletons) ).
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(f156,axiom,
! [X0] :
( ordered_pair(first(X0),second(X0)) = X0
| first(X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_1st_and_2nd_4) ).
fof(f207,plain,
x != complement(intersection(complement(singleton(singleton(first(x)))),complement(singleton(complement(intersection(complement(singleton(first(x))),complement(singleton(singleton(second(x)))))))))),
inference(definition_unfolding,[],[f160,f163]) ).
fof(f160,axiom,
x != ordered_pair(first(x),second(x)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_non_sets3_1) ).
fof(f161,axiom,
x != first(x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_unique_1st_in_pair_of_non_sets) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET115-7 : TPTP v8.1.0. Bugfixed v7.3.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.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 13:21:15 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.47 % (27960)lrs+1004_1:734_av=off:awrs=converge:awrsf=70:br=off:ep=RSTC:erd=off:gs=on:nwc=3.0:s2a=on:s2agt=16:sp=occurrence:updr=off:urr=on:i=6:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.21/0.48 % (27968)lrs+1003_1:1024_add=large:afr=on:cond=fast:fsr=off:gs=on:sos=on:sp=reverse_arity:i=28:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/28Mi)
% 0.21/0.48 % (27960)Instruction limit reached!
% 0.21/0.48 % (27960)------------------------------
% 0.21/0.48 % (27960)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.48 % (27960)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.48 % (27960)Termination reason: Unknown
% 0.21/0.48 % (27960)Termination phase: Property scanning
% 0.21/0.48
% 0.21/0.48 % (27960)Memory used [KB]: 1407
% 0.21/0.48 % (27960)Time elapsed: 0.006 s
% 0.21/0.48 % (27960)Instructions burned: 6 (million)
% 0.21/0.48 % (27960)------------------------------
% 0.21/0.48 % (27960)------------------------------
% 0.21/0.50 % (27968)First to succeed.
% 0.21/0.51 % (27968)Refutation found. Thanks to Tanya!
% 0.21/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51 % (27968)------------------------------
% 0.21/0.51 % (27968)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (27968)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (27968)Termination reason: Refutation
% 0.21/0.51
% 0.21/0.51 % (27968)Memory used [KB]: 10874
% 0.21/0.51 % (27968)Time elapsed: 0.083 s
% 0.21/0.51 % (27968)Instructions burned: 22 (million)
% 0.21/0.51 % (27968)------------------------------
% 0.21/0.51 % (27968)------------------------------
% 0.21/0.51 % (27949)Success in time 0.158 s
%------------------------------------------------------------------------------