TSTP Solution File: SET788+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET788+1 : TPTP v8.1.0. Released v3.1.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 : n014.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:25:39 EDT 2022
% Result : Theorem 0.21s 0.53s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 1 unt; 0 def)
% Number of atoms : 146 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 171 ( 61 ~; 71 |; 20 &)
% ( 13 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 64 ( 53 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f79,plain,
$false,
inference(avatar_sat_refutation,[],[f24,f25,f75,f78]) ).
fof(f78,plain,
( ~ spl3_1
| spl3_2 ),
inference(avatar_contradiction_clause,[],[f77]) ).
fof(f77,plain,
( $false
| ~ spl3_1
| spl3_2 ),
inference(subsumption_resolution,[],[f76,f22]) ).
fof(f22,plain,
( ~ equalish(sK2,sK1)
| spl3_2 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f21,plain,
( spl3_2
<=> equalish(sK2,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f76,plain,
( equalish(sK2,sK1)
| ~ spl3_1 ),
inference(resolution,[],[f19,f62]) ).
fof(f62,plain,
! [X0,X1] :
( ~ equalish(X0,X1)
| equalish(X1,X0) ),
inference(subsumption_resolution,[],[f61,f27]) ).
fof(f27,plain,
! [X3,X4,X5] :
( a_member_of(sK0(X3,X4),X3)
| a_member_of(sK0(X3,X4),X5)
| equalish(X4,X3)
| ~ equalish(X5,X4) ),
inference(resolution,[],[f14,f12]) ).
fof(f12,plain,
! [X3,X0,X1] :
( ~ a_member_of(X3,X0)
| a_member_of(X3,X1)
| ~ equalish(X1,X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ! [X0,X1] :
( ( equalish(X1,X0)
| ( ( ~ a_member_of(sK0(X0,X1),X1)
| ~ a_member_of(sK0(X0,X1),X0) )
& ( a_member_of(sK0(X0,X1),X1)
| a_member_of(sK0(X0,X1),X0) ) ) )
& ( ! [X3] :
( ( a_member_of(X3,X0)
| ~ a_member_of(X3,X1) )
& ( a_member_of(X3,X1)
| ~ a_member_of(X3,X0) ) )
| ~ equalish(X1,X0) ) )
& ( ~ equalish(sK1,sK2)
| ~ equalish(sK2,sK1) )
& ( equalish(sK1,sK2)
| equalish(sK2,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8,f7]) ).
fof(f7,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ a_member_of(X2,X1)
| ~ a_member_of(X2,X0) )
& ( a_member_of(X2,X1)
| a_member_of(X2,X0) ) )
=> ( ( ~ a_member_of(sK0(X0,X1),X1)
| ~ a_member_of(sK0(X0,X1),X0) )
& ( a_member_of(sK0(X0,X1),X1)
| a_member_of(sK0(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X4,X5] :
( ( ~ equalish(X4,X5)
| ~ equalish(X5,X4) )
& ( equalish(X4,X5)
| equalish(X5,X4) ) )
=> ( ( ~ equalish(sK1,sK2)
| ~ equalish(sK2,sK1) )
& ( equalish(sK1,sK2)
| equalish(sK2,sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ! [X0,X1] :
( ( equalish(X1,X0)
| ? [X2] :
( ( ~ a_member_of(X2,X1)
| ~ a_member_of(X2,X0) )
& ( a_member_of(X2,X1)
| a_member_of(X2,X0) ) ) )
& ( ! [X3] :
( ( a_member_of(X3,X0)
| ~ a_member_of(X3,X1) )
& ( a_member_of(X3,X1)
| ~ a_member_of(X3,X0) ) )
| ~ equalish(X1,X0) ) )
& ? [X4,X5] :
( ( ~ equalish(X4,X5)
| ~ equalish(X5,X4) )
& ( equalish(X4,X5)
| equalish(X5,X4) ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ! [X1,X0] :
( ( equalish(X0,X1)
| ? [X2] :
( ( ~ a_member_of(X2,X0)
| ~ a_member_of(X2,X1) )
& ( a_member_of(X2,X0)
| a_member_of(X2,X1) ) ) )
& ( ! [X2] :
( ( a_member_of(X2,X1)
| ~ a_member_of(X2,X0) )
& ( a_member_of(X2,X0)
| ~ a_member_of(X2,X1) ) )
| ~ equalish(X0,X1) ) )
& ? [X4,X3] :
( ( ~ equalish(X4,X3)
| ~ equalish(X3,X4) )
& ( equalish(X4,X3)
| equalish(X3,X4) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ! [X1,X0] :
( equalish(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X1)
<=> a_member_of(X2,X0) ) )
& ? [X4,X3] :
( equalish(X3,X4)
<~> equalish(X4,X3) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ! [X1,X0] :
( equalish(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X1)
<=> a_member_of(X2,X0) ) )
=> ! [X4,X3] :
( equalish(X3,X4)
<=> equalish(X4,X3) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X1,X0] :
( equalish(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X1)
<=> a_member_of(X2,X0) ) )
=> ! [X0,X1] :
( equalish(X1,X0)
<=> equalish(X0,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X1,X0] :
( equalish(X0,X1)
<=> ! [X2] :
( a_member_of(X2,X1)
<=> a_member_of(X2,X0) ) )
=> ! [X0,X1] :
( equalish(X1,X0)
<=> equalish(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f14,plain,
! [X0,X1] :
( a_member_of(sK0(X0,X1),X1)
| a_member_of(sK0(X0,X1),X0)
| equalish(X1,X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f61,plain,
! [X0,X1] :
( equalish(X1,X0)
| ~ a_member_of(sK0(X0,X1),X0)
| ~ equalish(X0,X1) ),
inference(duplicate_literal_removal,[],[f58]) ).
fof(f58,plain,
! [X0,X1] :
( ~ equalish(X0,X1)
| equalish(X1,X0)
| ~ a_member_of(sK0(X0,X1),X0)
| equalish(X1,X0)
| ~ equalish(X0,X1) ),
inference(resolution,[],[f55,f15]) ).
fof(f15,plain,
! [X0,X1] :
( ~ a_member_of(sK0(X0,X1),X1)
| equalish(X1,X0)
| ~ a_member_of(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f55,plain,
! [X2,X3,X1] :
( a_member_of(sK0(X2,X1),X3)
| ~ equalish(X2,X1)
| ~ equalish(X2,X3)
| equalish(X1,X2) ),
inference(resolution,[],[f51,f13]) ).
fof(f13,plain,
! [X3,X0,X1] :
( ~ a_member_of(X3,X1)
| a_member_of(X3,X0)
| ~ equalish(X1,X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f51,plain,
! [X0,X1] :
( a_member_of(sK0(X0,X1),X0)
| equalish(X1,X0)
| ~ equalish(X0,X1) ),
inference(factoring,[],[f27]) ).
fof(f19,plain,
( equalish(sK1,sK2)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f17,plain,
( spl3_1
<=> equalish(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f75,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_contradiction_clause,[],[f74]) ).
fof(f74,plain,
( $false
| spl3_1
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f72,f18]) ).
fof(f18,plain,
( ~ equalish(sK1,sK2)
| spl3_1 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f72,plain,
( equalish(sK1,sK2)
| ~ spl3_2 ),
inference(resolution,[],[f62,f23]) ).
fof(f23,plain,
( equalish(sK2,sK1)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f25,plain,
( ~ spl3_2
| ~ spl3_1 ),
inference(avatar_split_clause,[],[f11,f17,f21]) ).
fof(f11,plain,
( ~ equalish(sK1,sK2)
| ~ equalish(sK2,sK1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f24,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f10,f21,f17]) ).
fof(f10,plain,
( equalish(sK2,sK1)
| equalish(sK1,sK2) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET788+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/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.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 14:21:03 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.52 % (19388)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 0.21/0.52 % (19396)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/355Mi)
% 0.21/0.52 % (19377)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.21/0.52 % (19380)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.21/0.52 % (19378)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.21/0.52 % (19373)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.21/0.52 % (19381)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.21/0.52 % (19388)First to succeed.
% 0.21/0.52 % (19392)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/500Mi)
% 0.21/0.52 % (19378)Also succeeded, but the first one will report.
% 0.21/0.53 % (19388)Refutation found. Thanks to Tanya!
% 0.21/0.53 % SZS status Theorem for theBenchmark
% 0.21/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.53 % (19388)------------------------------
% 0.21/0.53 % (19388)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (19388)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (19388)Termination reason: Refutation
% 0.21/0.53
% 0.21/0.53 % (19388)Memory used [KB]: 5373
% 0.21/0.53 % (19388)Time elapsed: 0.062 s
% 0.21/0.53 % (19388)Instructions burned: 3 (million)
% 0.21/0.53 % (19388)------------------------------
% 0.21/0.53 % (19388)------------------------------
% 0.21/0.53 % (19366)Success in time 0.165 s
%------------------------------------------------------------------------------