TSTP Solution File: SET080-6 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET080-6 : 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 : n007.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:59 EDT 2022
% Result : Unsatisfiable 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 27 ( 10 unt; 0 def)
% Number of atoms : 47 ( 16 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 37 ( 17 ~; 18 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 11 ( 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f335,plain,
$false,
inference(avatar_sat_refutation,[],[f313,f323,f334]) ).
fof(f334,plain,
~ spl1_16,
inference(avatar_contradiction_clause,[],[f333]) ).
fof(f333,plain,
( $false
| ~ spl1_16 ),
inference(subsumption_resolution,[],[f327,f155]) ).
fof(f155,plain,
~ member(null_class,universal_class),
inference(subsumption_resolution,[],[f154,f146]) ).
fof(f146,plain,
~ member(null_class,sF0),
inference(definition_folding,[],[f132,f145]) ).
fof(f145,plain,
unordered_pair(null_class,null_class) = sF0,
introduced(function_definition,[]) ).
fof(f132,plain,
~ member(null_class,unordered_pair(null_class,null_class)),
inference(definition_unfolding,[],[f92,f12]) ).
fof(f12,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_set) ).
fof(f92,axiom,
~ member(null_class,singleton(null_class)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_null_class_in_its_singleton_1) ).
fof(f154,plain,
( ~ member(null_class,universal_class)
| member(null_class,sF0) ),
inference(superposition,[],[f9,f145]) ).
fof(f9,axiom,
! [X0,X1] :
( member(X0,unordered_pair(X0,X1))
| ~ member(X0,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair2) ).
fof(f327,plain,
( member(null_class,universal_class)
| ~ spl1_16 ),
inference(backward_demodulation,[],[f148,f312]) ).
fof(f312,plain,
( null_class = sF0
| ~ spl1_16 ),
inference(avatar_component_clause,[],[f310]) ).
fof(f310,plain,
( spl1_16
<=> null_class = sF0 ),
introduced(avatar_definition,[new_symbols(naming,[spl1_16])]) ).
fof(f148,plain,
member(sF0,universal_class),
inference(superposition,[],[f11,f145]) ).
fof(f11,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pairs_in_universal) ).
fof(f323,plain,
( spl1_16
| ~ spl1_15 ),
inference(avatar_split_clause,[],[f322,f306,f310]) ).
fof(f306,plain,
( spl1_15
<=> null_class = regular(sF0) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_15])]) ).
fof(f322,plain,
( null_class = sF0
| ~ spl1_15 ),
inference(subsumption_resolution,[],[f316,f146]) ).
fof(f316,plain,
( member(null_class,sF0)
| null_class = sF0
| ~ spl1_15 ),
inference(superposition,[],[f66,f308]) ).
fof(f308,plain,
( null_class = regular(sF0)
| ~ spl1_15 ),
inference(avatar_component_clause,[],[f306]) ).
fof(f66,axiom,
! [X0] :
( member(regular(X0),X0)
| null_class = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',regularity1) ).
fof(f313,plain,
( spl1_15
| spl1_16 ),
inference(avatar_split_clause,[],[f303,f310,f306]) ).
fof(f303,plain,
( null_class = sF0
| null_class = regular(sF0) ),
inference(resolution,[],[f255,f66]) ).
fof(f255,plain,
! [X0] :
( ~ member(X0,sF0)
| null_class = X0 ),
inference(duplicate_literal_removal,[],[f254]) ).
fof(f254,plain,
! [X0] :
( null_class = X0
| null_class = X0
| ~ member(X0,sF0) ),
inference(superposition,[],[f8,f145]) ).
fof(f8,axiom,
! [X2,X0,X1] :
( ~ member(X2,unordered_pair(X0,X1))
| X1 = X2
| X0 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_member) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET080-6 : TPTP v8.1.0. Bugfixed v2.1.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.13/0.34 % Computer : n007.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 12:56:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.50 % (20110)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.21/0.51 % (20110)First to succeed.
% 0.21/0.51 % (20133)lrs+1011_1:1_aac=none:bsr=unit_only:ep=R:sac=on:sos=all:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.51 % (20110)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 % (20110)------------------------------
% 0.21/0.51 % (20110)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (20110)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (20110)Termination reason: Refutation
% 0.21/0.51
% 0.21/0.51 % (20110)Memory used [KB]: 6524
% 0.21/0.51 % (20110)Time elapsed: 0.088 s
% 0.21/0.51 % (20110)Instructions burned: 19 (million)
% 0.21/0.51 % (20110)------------------------------
% 0.21/0.51 % (20110)------------------------------
% 0.21/0.51 % (20109)Success in time 0.16 s
%------------------------------------------------------------------------------