TSTP Solution File: LCL686+1.001 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL686+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n009.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 May 1 03:19:23 EDT 2024
% Result : Theorem 0.59s 0.84s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 4 unt; 0 def)
% Number of atoms : 292 ( 0 equ)
% Maximal formula atoms : 38 ( 9 avg)
% Number of connectives : 459 ( 199 ~; 155 |; 98 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 123 ( 84 !; 39 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f51,plain,
$false,
inference(resolution,[],[f50,f33]) ).
fof(f33,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox2/tmp/tmp.jDX2M61nNd/Vampire---4.8_26283',reflexivity) ).
fof(f50,plain,
! [X0] : ~ r1(sK1,X0),
inference(duplicate_literal_removal,[],[f47]) ).
fof(f47,plain,
! [X0] :
( ~ r1(sK1,X0)
| ~ r1(sK1,X0)
| ~ r1(sK1,X0) ),
inference(resolution,[],[f46,f29]) ).
fof(f29,plain,
! [X2] :
( r1(X2,sK2(X2))
| ~ r1(sK1,X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ! [X2] :
( ( ( ~ p1(sK2(X2))
| ~ p2(sK2(X2)) )
& ( p2(sK2(X2))
| p1(sK2(X2)) )
& r1(X2,sK2(X2))
& ~ p3(sK3(X2))
& r1(X2,sK3(X2))
& ! [X5] :
( ( ( ~ p1(X5)
| p2(X5) )
& ( p1(X5)
| ~ p2(X5) ) )
| ~ r1(X2,X5) )
& r1(X2,sK4(X2)) )
| ~ r1(sK1,X2) )
& r1(sK0,sK1)
& p1(sK6)
& r1(sK5,sK6)
& p3(sK5)
& r1(sK0,sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f8,f17,f16,f15,f14,f13,f12,f11]) ).
fof(f11,plain,
( ? [X0] :
( ? [X1] :
( ! [X2] :
( ( ? [X3] :
( ( ~ p1(X3)
| ~ p2(X3) )
& ( p2(X3)
| p1(X3) )
& r1(X2,X3) )
& ? [X4] :
( ~ p3(X4)
& r1(X2,X4) )
& ! [X5] :
( ( ( ~ p1(X5)
| p2(X5) )
& ( p1(X5)
| ~ p2(X5) ) )
| ~ r1(X2,X5) )
& ? [X6] : r1(X2,X6) )
| ~ r1(X1,X2) )
& r1(X0,X1) )
& ? [X7] :
( ? [X8] :
( p1(X8)
& r1(X7,X8) )
& p3(X7)
& r1(X0,X7) ) )
=> ( ? [X1] :
( ! [X2] :
( ( ? [X3] :
( ( ~ p1(X3)
| ~ p2(X3) )
& ( p2(X3)
| p1(X3) )
& r1(X2,X3) )
& ? [X4] :
( ~ p3(X4)
& r1(X2,X4) )
& ! [X5] :
( ( ( ~ p1(X5)
| p2(X5) )
& ( p1(X5)
| ~ p2(X5) ) )
| ~ r1(X2,X5) )
& ? [X6] : r1(X2,X6) )
| ~ r1(X1,X2) )
& r1(sK0,X1) )
& ? [X7] :
( ? [X8] :
( p1(X8)
& r1(X7,X8) )
& p3(X7)
& r1(sK0,X7) ) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ? [X1] :
( ! [X2] :
( ( ? [X3] :
( ( ~ p1(X3)
| ~ p2(X3) )
& ( p2(X3)
| p1(X3) )
& r1(X2,X3) )
& ? [X4] :
( ~ p3(X4)
& r1(X2,X4) )
& ! [X5] :
( ( ( ~ p1(X5)
| p2(X5) )
& ( p1(X5)
| ~ p2(X5) ) )
| ~ r1(X2,X5) )
& ? [X6] : r1(X2,X6) )
| ~ r1(X1,X2) )
& r1(sK0,X1) )
=> ( ! [X2] :
( ( ? [X3] :
( ( ~ p1(X3)
| ~ p2(X3) )
& ( p2(X3)
| p1(X3) )
& r1(X2,X3) )
& ? [X4] :
( ~ p3(X4)
& r1(X2,X4) )
& ! [X5] :
( ( ( ~ p1(X5)
| p2(X5) )
& ( p1(X5)
| ~ p2(X5) ) )
| ~ r1(X2,X5) )
& ? [X6] : r1(X2,X6) )
| ~ r1(sK1,X2) )
& r1(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X2] :
( ? [X3] :
( ( ~ p1(X3)
| ~ p2(X3) )
& ( p2(X3)
| p1(X3) )
& r1(X2,X3) )
=> ( ( ~ p1(sK2(X2))
| ~ p2(sK2(X2)) )
& ( p2(sK2(X2))
| p1(sK2(X2)) )
& r1(X2,sK2(X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X2] :
( ? [X4] :
( ~ p3(X4)
& r1(X2,X4) )
=> ( ~ p3(sK3(X2))
& r1(X2,sK3(X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X2] :
( ? [X6] : r1(X2,X6)
=> r1(X2,sK4(X2)) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ? [X7] :
( ? [X8] :
( p1(X8)
& r1(X7,X8) )
& p3(X7)
& r1(sK0,X7) )
=> ( ? [X8] :
( p1(X8)
& r1(sK5,X8) )
& p3(sK5)
& r1(sK0,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ? [X8] :
( p1(X8)
& r1(sK5,X8) )
=> ( p1(sK6)
& r1(sK5,sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
? [X0] :
( ? [X1] :
( ! [X2] :
( ( ? [X3] :
( ( ~ p1(X3)
| ~ p2(X3) )
& ( p2(X3)
| p1(X3) )
& r1(X2,X3) )
& ? [X4] :
( ~ p3(X4)
& r1(X2,X4) )
& ! [X5] :
( ( ( ~ p1(X5)
| p2(X5) )
& ( p1(X5)
| ~ p2(X5) ) )
| ~ r1(X2,X5) )
& ? [X6] : r1(X2,X6) )
| ~ r1(X1,X2) )
& r1(X0,X1) )
& ? [X7] :
( ? [X8] :
( p1(X8)
& r1(X7,X8) )
& p3(X7)
& r1(X0,X7) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
? [X0] :
~ ( ! [X1] :
( ~ ! [X2] :
( ~ ( ! [X3] :
( ( p1(X3)
& p2(X3) )
| ( ~ p2(X3)
& ~ p1(X3) )
| ~ r1(X2,X3) )
| ! [X4] :
( p3(X4)
| ~ r1(X2,X4) )
| ~ ! [X5] :
( ~ ( ( p1(X5)
& ~ p2(X5) )
| ( ~ p1(X5)
& p2(X5) ) )
| ~ r1(X2,X5) )
| ! [X6] : ~ r1(X2,X6) )
| ~ r1(X1,X2) )
| ~ r1(X0,X1) )
| ! [X7] :
( ! [X8] :
( ~ p1(X8)
| ~ r1(X7,X8) )
| ~ p3(X7)
| ~ r1(X0,X7) ) ),
inference(flattening,[],[f6]) ).
fof(f6,plain,
~ ~ ? [X0] :
~ ( ! [X1] :
( ~ ! [X2] :
( ~ ( ! [X3] :
( ( p1(X3)
& p2(X3) )
| ( ~ p2(X3)
& ~ p1(X3) )
| ~ r1(X2,X3) )
| ! [X4] :
( p3(X4)
| ~ r1(X2,X4) )
| ~ ! [X5] :
( ~ ( ( p1(X5)
& ~ p2(X5) )
| ( ~ p1(X5)
& p2(X5) ) )
| ~ r1(X2,X5) )
| ! [X6] : ~ r1(X2,X6) )
| ~ r1(X1,X2) )
| ~ r1(X0,X1) )
| ! [X7] :
( ! [X8] :
( ~ p1(X8)
| ~ r1(X7,X8) )
| ~ p3(X7)
| ~ r1(X0,X7) ) ),
inference(true_and_false_elimination,[],[f5]) ).
fof(f5,plain,
~ ~ ? [X0] :
~ ( ! [X1] :
( ~ ! [X2] :
( ~ ( ! [X3] :
( ( p1(X3)
& p2(X3) )
| ( ~ p2(X3)
& ~ p1(X3) )
| ~ r1(X2,X3) )
| ! [X4] :
( p3(X4)
| ~ r1(X2,X4) )
| ~ ! [X5] :
( ~ ( ( p1(X5)
& ~ p2(X5) )
| ( ~ p1(X5)
& p2(X5) ) )
| ~ r1(X2,X5) )
| ! [X6] :
( $false
| ~ r1(X2,X6) ) )
| ~ r1(X1,X2) )
| ~ r1(X0,X1) )
| ! [X7] :
( ! [X8] :
( ~ p1(X8)
| ~ r1(X7,X8) )
| ~ p3(X7)
| ~ r1(X0,X7) ) ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ~ ? [X0] :
~ ( ! [X1] :
( ~ ! [X0] :
( ~ ( ! [X1] :
( ( p1(X1)
& p2(X1) )
| ( ~ p2(X1)
& ~ p1(X1) )
| ~ r1(X0,X1) )
| ! [X1] :
( p3(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( ~ ( ( p1(X1)
& ~ p2(X1) )
| ( ~ p1(X1)
& p2(X1) ) )
| ~ r1(X0,X1) )
| ! [X1] :
( $false
| ~ r1(X0,X1) ) )
| ~ r1(X1,X0) )
| ~ r1(X0,X1) )
| ! [X1] :
( ! [X0] :
( ~ p1(X0)
| ~ r1(X1,X0) )
| ~ p3(X1)
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
~ ? [X0] :
~ ( ! [X1] :
( ~ ! [X0] :
( ~ ( ! [X1] :
( ( p1(X1)
& p2(X1) )
| ( ~ p2(X1)
& ~ p1(X1) )
| ~ r1(X0,X1) )
| ! [X1] :
( p3(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( ~ ( ( p1(X1)
& ~ p2(X1) )
| ( ~ p1(X1)
& p2(X1) ) )
| ~ r1(X0,X1) )
| ! [X1] :
( $false
| ~ r1(X0,X1) ) )
| ~ r1(X1,X0) )
| ~ r1(X0,X1) )
| ! [X1] :
( ! [X0] :
( ~ p1(X0)
| ~ r1(X1,X0) )
| ~ p3(X1)
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jDX2M61nNd/Vampire---4.8_26283',main) ).
fof(f46,plain,
! [X0,X1] :
( ~ r1(X1,sK2(X0))
| ~ r1(sK1,X0)
| ~ r1(sK1,X1) ),
inference(duplicate_literal_removal,[],[f43]) ).
fof(f43,plain,
! [X0,X1] :
( ~ r1(sK1,X0)
| ~ r1(sK1,X0)
| ~ r1(X1,sK2(X0))
| ~ r1(sK1,X1)
| ~ r1(sK1,X0) ),
inference(resolution,[],[f42,f29]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ r1(X0,sK2(X1))
| ~ r1(sK1,X1)
| ~ r1(sK1,X0)
| ~ r1(X2,sK2(X1))
| ~ r1(sK1,X2) ),
inference(subsumption_resolution,[],[f40,f35]) ).
fof(f35,plain,
! [X0,X1] :
( p1(sK2(X0))
| ~ r1(X1,sK2(X0))
| ~ r1(sK1,X1)
| ~ r1(sK1,X0) ),
inference(duplicate_literal_removal,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( p1(sK2(X0))
| ~ r1(X1,sK2(X0))
| ~ r1(sK1,X1)
| p1(sK2(X0))
| ~ r1(sK1,X0) ),
inference(resolution,[],[f25,f30]) ).
fof(f30,plain,
! [X2] :
( p2(sK2(X2))
| p1(sK2(X2))
| ~ r1(sK1,X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f25,plain,
! [X2,X5] :
( ~ p2(X5)
| p1(X5)
| ~ r1(X2,X5)
| ~ r1(sK1,X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f40,plain,
! [X2,X0,X1] :
( ~ r1(sK1,X0)
| ~ r1(sK1,X1)
| ~ r1(X0,sK2(X1))
| ~ p1(sK2(X1))
| ~ r1(X2,sK2(X1))
| ~ r1(sK1,X2) ),
inference(resolution,[],[f38,f26]) ).
fof(f26,plain,
! [X2,X5] :
( p2(X5)
| ~ p1(X5)
| ~ r1(X2,X5)
| ~ r1(sK1,X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f38,plain,
! [X0,X1] :
( ~ p2(sK2(X1))
| ~ r1(sK1,X0)
| ~ r1(sK1,X1)
| ~ r1(X0,sK2(X1)) ),
inference(duplicate_literal_removal,[],[f37]) ).
fof(f37,plain,
! [X0,X1] :
( ~ r1(X0,sK2(X1))
| ~ r1(sK1,X0)
| ~ r1(sK1,X1)
| ~ p2(sK2(X1))
| ~ r1(sK1,X1) ),
inference(resolution,[],[f35,f31]) ).
fof(f31,plain,
! [X2] :
( ~ p1(sK2(X2))
| ~ p2(sK2(X2))
| ~ r1(sK1,X2) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL686+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.35 % Computer : n009.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8042.1875MB
% 0.10/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Tue Apr 30 16:41:55 EDT 2024
% 0.10/0.35 % CPUTime :
% 0.10/0.35 This is a FOF_THM_RFO_NEQ problem
% 0.10/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.jDX2M61nNd/Vampire---4.8_26283
% 0.59/0.83 % (26397)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.59/0.83 % (26398)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.59/0.83 % (26395)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.59/0.83 % (26399)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.59/0.83 % (26394)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.59/0.83 % (26400)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.59/0.83 % (26401)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.59/0.83 % (26396)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.59/0.83 % (26396)First to succeed.
% 0.59/0.83 % (26395)Also succeeded, but the first one will report.
% 0.59/0.84 % (26396)Refutation found. Thanks to Tanya!
% 0.59/0.84 % SZS status Theorem for Vampire---4
% 0.59/0.84 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.84 % (26396)------------------------------
% 0.59/0.84 % (26396)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.84 % (26396)Termination reason: Refutation
% 0.59/0.84
% 0.59/0.84 % (26396)Memory used [KB]: 979
% 0.59/0.84 % (26396)Time elapsed: 0.004 s
% 0.59/0.84 % (26396)Instructions burned: 5 (million)
% 0.59/0.84 % (26396)------------------------------
% 0.59/0.84 % (26396)------------------------------
% 0.59/0.84 % (26393)Success in time 0.48 s
% 0.59/0.84 % Vampire---4.8 exiting
%------------------------------------------------------------------------------