TSTP Solution File: SEU142+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU142+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --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:32:06 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 53 ( 15 unt; 0 def)
% Number of atoms : 115 ( 53 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 97 ( 35 ~; 45 |; 0 &)
% ( 14 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 61 ( 59 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f130,plain,
$false,
inference(avatar_sat_refutation,[],[f104,f110,f125,f127,f129]) ).
fof(f129,plain,
spl6_4,
inference(avatar_contradiction_clause,[],[f128]) ).
fof(f128,plain,
( $false
| spl6_4 ),
inference(resolution,[],[f124,f45]) ).
fof(f45,plain,
in(sK1,sF4),
inference(superposition,[],[f34,f40]) ).
fof(f40,plain,
unordered_pair(sK1,sK1) = sF4,
introduced(function_definition,[]) ).
fof(f34,plain,
! [X2,X3] : in(X3,unordered_pair(X2,X3)),
inference(equality_resolution,[],[f33]) ).
fof(f33,plain,
! [X2,X3,X1] :
( in(X3,X1)
| unordered_pair(X2,X3) != X1 ),
inference(equality_resolution,[],[f21]) ).
fof(f21,plain,
! [X2,X3,X0,X1] :
( in(X3,X1)
| X0 != X3
| unordered_pair(X2,X0) != X1 ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X1,X2,X0] :
( unordered_pair(X2,X0) = X1
<=> ! [X3] :
( ( X0 = X3
| X2 = X3 )
<=> in(X3,X1) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X2,X0] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X0 = X3
| X1 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f124,plain,
( ~ in(sK1,sF4)
| spl6_4 ),
inference(avatar_component_clause,[],[f122]) ).
fof(f122,plain,
( spl6_4
<=> in(sK1,sF4) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f127,plain,
spl6_3,
inference(avatar_contradiction_clause,[],[f126]) ).
fof(f126,plain,
( $false
| spl6_3 ),
inference(resolution,[],[f120,f43]) ).
fof(f43,plain,
in(sK1,sF5),
inference(superposition,[],[f38,f41]) ).
fof(f41,plain,
sF5 = singleton(sK1),
introduced(function_definition,[]) ).
fof(f38,plain,
! [X2] : in(X2,singleton(X2)),
inference(equality_resolution,[],[f37]) ).
fof(f37,plain,
! [X2,X1] :
( in(X2,singleton(X1))
| X1 != X2 ),
inference(equality_resolution,[],[f31]) ).
fof(f31,plain,
! [X2,X0,X1] :
( singleton(X1) != X0
| in(X2,X0)
| X1 != X2 ),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( ! [X2] :
( X1 = X2
<=> in(X2,X0) )
<=> singleton(X1) = X0 ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X1)
<=> X0 = X2 )
<=> singleton(X0) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f120,plain,
( ~ in(sK1,sF5)
| spl6_3 ),
inference(avatar_component_clause,[],[f118]) ).
fof(f118,plain,
( spl6_3
<=> in(sK1,sF5) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f125,plain,
( ~ spl6_3
| spl6_2
| ~ spl6_4
| ~ spl6_1 ),
inference(avatar_split_clause,[],[f114,f97,f122,f101,f118]) ).
fof(f101,plain,
( spl6_2
<=> sF5 = sF4 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f97,plain,
( spl6_1
<=> sK2(sF5,sF4) = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f114,plain,
( ~ in(sK1,sF4)
| sF5 = sF4
| ~ in(sK1,sF5)
| ~ spl6_1 ),
inference(superposition,[],[f27,f99]) ).
fof(f99,plain,
( sK2(sF5,sF4) = sK1
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f97]) ).
fof(f27,plain,
! [X0,X1] :
( ~ in(sK2(X0,X1),X1)
| ~ in(sK2(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( ? [X2] :
( in(X2,X1)
<~> in(X2,X0) )
| X0 = X1 ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski) ).
fof(f110,plain,
~ spl6_2,
inference(avatar_contradiction_clause,[],[f109]) ).
fof(f109,plain,
( $false
| ~ spl6_2 ),
inference(trivial_inequality_removal,[],[f108]) ).
fof(f108,plain,
( sF4 != sF4
| ~ spl6_2 ),
inference(superposition,[],[f42,f103]) ).
fof(f103,plain,
( sF5 = sF4
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f101]) ).
fof(f42,plain,
sF5 != sF4,
inference(definition_folding,[],[f25,f41,f40]) ).
fof(f25,plain,
unordered_pair(sK1,sK1) != singleton(sK1),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
? [X0] : singleton(X0) != unordered_pair(X0,X0),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f104,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f93,f101,f97]) ).
fof(f93,plain,
( sF5 = sF4
| sK2(sF5,sF4) = sK1 ),
inference(duplicate_literal_removal,[],[f92]) ).
fof(f92,plain,
( sK2(sF5,sF4) = sK1
| sF5 = sF4
| sK2(sF5,sF4) = sK1 ),
inference(resolution,[],[f75,f63]) ).
fof(f63,plain,
! [X0] :
( ~ in(X0,sF5)
| sK1 = X0 ),
inference(superposition,[],[f39,f41]) ).
fof(f39,plain,
! [X2,X1] :
( ~ in(X2,singleton(X1))
| X1 = X2 ),
inference(equality_resolution,[],[f30]) ).
fof(f30,plain,
! [X2,X0,X1] :
( singleton(X1) != X0
| ~ in(X2,X0)
| X1 = X2 ),
inference(cnf_transformation,[],[f12]) ).
fof(f75,plain,
! [X7] :
( in(sK2(X7,sF4),X7)
| sF4 = X7
| sK2(X7,sF4) = sK1 ),
inference(resolution,[],[f26,f70]) ).
fof(f70,plain,
! [X0] :
( ~ in(X0,sF4)
| sK1 = X0 ),
inference(duplicate_literal_removal,[],[f67]) ).
fof(f67,plain,
! [X0] :
( sK1 = X0
| sK1 = X0
| ~ in(X0,sF4) ),
inference(superposition,[],[f32,f40]) ).
fof(f32,plain,
! [X2,X3,X0] :
( ~ in(X3,unordered_pair(X2,X0))
| X0 = X3
| X2 = X3 ),
inference(equality_resolution,[],[f22]) ).
fof(f22,plain,
! [X2,X3,X0,X1] :
( ~ in(X3,X1)
| X2 = X3
| X0 = X3
| unordered_pair(X2,X0) != X1 ),
inference(cnf_transformation,[],[f10]) ).
fof(f26,plain,
! [X0,X1] :
( in(sK2(X0,X1),X1)
| in(sK2(X0,X1),X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU142+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34 % Computer : n020.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 14:45:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.48 % (2517)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.20/0.49 % (2497)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.49 % (2518)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/467Mi)
% 0.20/0.49 % (2497)First to succeed.
% 0.20/0.49 % (2497)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 % (2497)------------------------------
% 0.20/0.49 % (2497)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (2497)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (2497)Termination reason: Refutation
% 0.20/0.49
% 0.20/0.49 % (2497)Memory used [KB]: 5500
% 0.20/0.49 % (2497)Time elapsed: 0.098 s
% 0.20/0.49 % (2497)Instructions burned: 3 (million)
% 0.20/0.49 % (2497)------------------------------
% 0.20/0.49 % (2497)------------------------------
% 0.20/0.49 % (2492)Success in time 0.145 s
%------------------------------------------------------------------------------