TSTP Solution File: SET776+4 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET776+4 : TPTP v8.1.0. Released v2.2.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 : n019.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:22:12 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 14 unt; 0 def)
% Number of atoms : 271 ( 0 equ)
% Maximal formula atoms : 34 ( 7 avg)
% Number of connectives : 318 ( 81 ~; 67 |; 139 &)
% ( 7 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 138 ( 88 !; 50 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f87,plain,
$false,
inference(subsumption_resolution,[],[f83,f76]) ).
fof(f76,plain,
apply(sK0,sK3,sK5),
inference(unit_resulting_resolution,[],[f36,f37,f46,f41,f42,f65,f33]) ).
fof(f33,plain,
! [X3,X0,X1,X4,X5] :
( ~ apply(X1,X5,X4)
| ~ apply(X1,X4,X3)
| ~ pre_order(X1,X0)
| ~ member(X3,X0)
| apply(X1,X5,X3)
| ~ member(X4,X0)
| ~ member(X5,X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( ( ! [X2] :
( apply(X1,X2,X2)
| ~ member(X2,X0) )
& ! [X3,X4,X5] :
( ~ apply(X1,X5,X4)
| ~ member(X3,X0)
| apply(X1,X5,X3)
| ~ member(X5,X0)
| ~ member(X4,X0)
| ~ apply(X1,X4,X3) ) )
| ~ pre_order(X1,X0) ),
inference(rectify,[],[f25]) ).
fof(f25,plain,
! [X1,X0] :
( ( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
& ! [X4,X5,X3] :
( ~ apply(X0,X3,X5)
| ~ member(X4,X1)
| apply(X0,X3,X4)
| ~ member(X3,X1)
| ~ member(X5,X1)
| ~ apply(X0,X5,X4) ) )
| ~ pre_order(X0,X1) ),
inference(flattening,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( ! [X4,X5,X3] :
( apply(X0,X3,X4)
| ~ apply(X0,X5,X4)
| ~ apply(X0,X3,X5)
| ~ member(X5,X1)
| ~ member(X4,X1)
| ~ member(X3,X1) )
& ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) ) )
| ~ pre_order(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( pre_order(X0,X1)
=> ( ! [X4,X5,X3] :
( ( member(X5,X1)
& member(X4,X1)
& member(X3,X1) )
=> ( ( apply(X0,X5,X4)
& apply(X0,X3,X5) )
=> apply(X0,X3,X4) ) )
& ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) ) ) ),
inference(unused_predicate_definition_removal,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( pre_order(X0,X1)
<=> ( ! [X4,X5,X3] :
( ( member(X5,X1)
& member(X4,X1)
& member(X3,X1) )
=> ( ( apply(X0,X5,X4)
& apply(X0,X3,X5) )
=> apply(X0,X3,X4) ) )
& ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) ) ) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X6,X3] :
( pre_order(X6,X3)
<=> ( ! [X2] :
( member(X2,X3)
=> apply(X6,X2,X2) )
& ! [X2,X5,X4] :
( ( member(X2,X3)
& member(X4,X3)
& member(X5,X3) )
=> ( ( apply(X6,X2,X4)
& apply(X6,X4,X5) )
=> apply(X6,X2,X5) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pre_order) ).
fof(f65,plain,
apply(sK0,sK6,sK5),
inference(unit_resulting_resolution,[],[f37,f41,f40,f44]) ).
fof(f44,plain,
! [X3,X4] :
( ~ apply(sK2,X4,X3)
| ~ member(X3,sK1)
| apply(sK0,X4,X3)
| ~ member(X4,sK1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
( pre_order(sK0,sK1)
& ! [X3,X4] :
( ( ( ( apply(sK0,X3,X4)
& apply(sK0,X4,X3) )
| ~ apply(sK2,X4,X3) )
& ( apply(sK2,X4,X3)
| ~ apply(sK0,X3,X4)
| ~ apply(sK0,X4,X3) ) )
| ~ member(X4,sK1)
| ~ member(X3,sK1) )
& apply(sK0,sK3,sK6)
& member(sK5,sK1)
& apply(sK2,sK6,sK5)
& ~ apply(sK0,sK4,sK5)
& apply(sK2,sK3,sK4)
& member(sK6,sK1)
& member(sK3,sK1)
& member(sK4,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f29,f31,f30]) ).
fof(f30,plain,
( ? [X0,X1,X2] :
( pre_order(X0,X1)
& ! [X3,X4] :
( ( ( ( apply(X0,X3,X4)
& apply(X0,X4,X3) )
| ~ apply(X2,X4,X3) )
& ( apply(X2,X4,X3)
| ~ apply(X0,X3,X4)
| ~ apply(X0,X4,X3) ) )
| ~ member(X4,X1)
| ~ member(X3,X1) )
& ? [X5,X6,X7,X8] :
( apply(X0,X5,X8)
& member(X7,X1)
& apply(X2,X8,X7)
& ~ apply(X0,X6,X7)
& apply(X2,X5,X6)
& member(X8,X1)
& member(X5,X1)
& member(X6,X1) ) )
=> ( pre_order(sK0,sK1)
& ! [X4,X3] :
( ( ( ( apply(sK0,X3,X4)
& apply(sK0,X4,X3) )
| ~ apply(sK2,X4,X3) )
& ( apply(sK2,X4,X3)
| ~ apply(sK0,X3,X4)
| ~ apply(sK0,X4,X3) ) )
| ~ member(X4,sK1)
| ~ member(X3,sK1) )
& ? [X8,X7,X6,X5] :
( apply(sK0,X5,X8)
& member(X7,sK1)
& apply(sK2,X8,X7)
& ~ apply(sK0,X6,X7)
& apply(sK2,X5,X6)
& member(X8,sK1)
& member(X5,sK1)
& member(X6,sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
( ? [X8,X7,X6,X5] :
( apply(sK0,X5,X8)
& member(X7,sK1)
& apply(sK2,X8,X7)
& ~ apply(sK0,X6,X7)
& apply(sK2,X5,X6)
& member(X8,sK1)
& member(X5,sK1)
& member(X6,sK1) )
=> ( apply(sK0,sK3,sK6)
& member(sK5,sK1)
& apply(sK2,sK6,sK5)
& ~ apply(sK0,sK4,sK5)
& apply(sK2,sK3,sK4)
& member(sK6,sK1)
& member(sK3,sK1)
& member(sK4,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
? [X0,X1,X2] :
( pre_order(X0,X1)
& ! [X3,X4] :
( ( ( ( apply(X0,X3,X4)
& apply(X0,X4,X3) )
| ~ apply(X2,X4,X3) )
& ( apply(X2,X4,X3)
| ~ apply(X0,X3,X4)
| ~ apply(X0,X4,X3) ) )
| ~ member(X4,X1)
| ~ member(X3,X1) )
& ? [X5,X6,X7,X8] :
( apply(X0,X5,X8)
& member(X7,X1)
& apply(X2,X8,X7)
& ~ apply(X0,X6,X7)
& apply(X2,X5,X6)
& member(X8,X1)
& member(X5,X1)
& member(X6,X1) ) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
? [X0,X1,X2] :
( pre_order(X0,X1)
& ! [X4,X3] :
( ( ( ( apply(X0,X4,X3)
& apply(X0,X3,X4) )
| ~ apply(X2,X3,X4) )
& ( apply(X2,X3,X4)
| ~ apply(X0,X4,X3)
| ~ apply(X0,X3,X4) ) )
| ~ member(X3,X1)
| ~ member(X4,X1) )
& ? [X6,X8,X7,X5] :
( apply(X0,X6,X5)
& member(X7,X1)
& apply(X2,X5,X7)
& ~ apply(X0,X8,X7)
& apply(X2,X6,X8)
& member(X5,X1)
& member(X6,X1)
& member(X8,X1) ) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
? [X0,X1,X2] :
( pre_order(X0,X1)
& ! [X4,X3] :
( ( ( ( apply(X0,X4,X3)
& apply(X0,X3,X4) )
| ~ apply(X2,X3,X4) )
& ( apply(X2,X3,X4)
| ~ apply(X0,X4,X3)
| ~ apply(X0,X3,X4) ) )
| ~ member(X3,X1)
| ~ member(X4,X1) )
& ? [X6,X8,X7,X5] :
( apply(X0,X6,X5)
& member(X7,X1)
& apply(X2,X5,X7)
& ~ apply(X0,X8,X7)
& apply(X2,X6,X8)
& member(X5,X1)
& member(X6,X1)
& member(X8,X1) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f23,plain,
? [X0,X1,X2] :
( pre_order(X0,X1)
& ! [X4,X3] :
( ( ( apply(X0,X4,X3)
& apply(X0,X3,X4) )
<=> apply(X2,X3,X4) )
| ~ member(X3,X1)
| ~ member(X4,X1) )
& ? [X6,X8,X7,X5] :
( apply(X0,X6,X5)
& member(X7,X1)
& apply(X2,X5,X7)
& ~ apply(X0,X8,X7)
& apply(X2,X6,X8)
& member(X5,X1)
& member(X6,X1)
& member(X8,X1) ) ),
inference(flattening,[],[f22]) ).
fof(f22,plain,
? [X2,X0,X1] :
( ? [X6,X7,X8,X5] :
( ~ apply(X0,X8,X7)
& apply(X2,X6,X8)
& apply(X0,X6,X5)
& apply(X2,X5,X7)
& member(X5,X1)
& member(X7,X1)
& member(X6,X1)
& member(X8,X1) )
& pre_order(X0,X1)
& ! [X4,X3] :
( ( ( apply(X0,X4,X3)
& apply(X0,X3,X4) )
<=> apply(X2,X3,X4) )
| ~ member(X3,X1)
| ~ member(X4,X1) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
~ ! [X2,X0,X1] :
( ( pre_order(X0,X1)
& ! [X4,X3] :
( ( member(X3,X1)
& member(X4,X1) )
=> ( ( apply(X0,X4,X3)
& apply(X0,X3,X4) )
<=> apply(X2,X3,X4) ) ) )
=> ! [X6,X7,X8,X5] :
( ( member(X5,X1)
& member(X7,X1)
& member(X6,X1)
& member(X8,X1) )
=> ( ( apply(X2,X6,X8)
& apply(X0,X6,X5)
& apply(X2,X5,X7) )
=> apply(X0,X8,X7) ) ) ),
inference(rectify,[],[f18]) ).
fof(f18,negated_conjecture,
~ ! [X7,X3,X6] :
( ( ! [X0,X1] :
( ( member(X1,X3)
& member(X0,X3) )
=> ( apply(X6,X0,X1)
<=> ( apply(X7,X0,X1)
& apply(X7,X1,X0) ) ) )
& pre_order(X7,X3) )
=> ! [X9,X8,X11,X10] :
( ( member(X11,X3)
& member(X9,X3)
& member(X10,X3)
& member(X8,X3) )
=> ( ( apply(X7,X8,X9)
& apply(X6,X9,X11)
& apply(X6,X8,X10) )
=> apply(X7,X10,X11) ) ) ),
inference(negated_conjecture,[],[f17]) ).
fof(f17,conjecture,
! [X7,X3,X6] :
( ( ! [X0,X1] :
( ( member(X1,X3)
& member(X0,X3) )
=> ( apply(X6,X0,X1)
<=> ( apply(X7,X0,X1)
& apply(X7,X1,X0) ) ) )
& pre_order(X7,X3) )
=> ! [X9,X8,X11,X10] :
( ( member(X11,X3)
& member(X9,X3)
& member(X10,X3)
& member(X8,X3) )
=> ( ( apply(X7,X8,X9)
& apply(X6,X9,X11)
& apply(X6,X8,X10) )
=> apply(X7,X10,X11) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIII12) ).
fof(f40,plain,
apply(sK2,sK6,sK5),
inference(cnf_transformation,[],[f32]) ).
fof(f42,plain,
apply(sK0,sK3,sK6),
inference(cnf_transformation,[],[f32]) ).
fof(f41,plain,
member(sK5,sK1),
inference(cnf_transformation,[],[f32]) ).
fof(f46,plain,
pre_order(sK0,sK1),
inference(cnf_transformation,[],[f32]) ).
fof(f37,plain,
member(sK6,sK1),
inference(cnf_transformation,[],[f32]) ).
fof(f36,plain,
member(sK3,sK1),
inference(cnf_transformation,[],[f32]) ).
fof(f83,plain,
~ apply(sK0,sK3,sK5),
inference(unit_resulting_resolution,[],[f35,f36,f46,f41,f39,f67,f33]) ).
fof(f67,plain,
apply(sK0,sK4,sK3),
inference(unit_resulting_resolution,[],[f35,f36,f38,f45]) ).
fof(f45,plain,
! [X3,X4] :
( ~ apply(sK2,X4,X3)
| apply(sK0,X3,X4)
| ~ member(X4,sK1)
| ~ member(X3,sK1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f38,plain,
apply(sK2,sK3,sK4),
inference(cnf_transformation,[],[f32]) ).
fof(f39,plain,
~ apply(sK0,sK4,sK5),
inference(cnf_transformation,[],[f32]) ).
fof(f35,plain,
member(sK4,sK1),
inference(cnf_transformation,[],[f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET776+4 : TPTP v8.1.0. Released v2.2.0.
% 0.06/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 : n019.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:20:35 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.51 % (5832)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.51 % (5831)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.51 % (5833)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.52 % (5826)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (5832)First to succeed.
% 0.20/0.52 % (5827)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.52 % (5832)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (5832)------------------------------
% 0.20/0.52 % (5832)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (5832)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (5832)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (5832)Memory used [KB]: 6012
% 0.20/0.52 % (5832)Time elapsed: 0.109 s
% 0.20/0.52 % (5832)Instructions burned: 3 (million)
% 0.20/0.52 % (5832)------------------------------
% 0.20/0.52 % (5832)------------------------------
% 0.20/0.52 % (5822)Success in time 0.169 s
%------------------------------------------------------------------------------