TSTP Solution File: LCL678+1.001 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL678+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n026.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 : Sun May 5 07:41:07 EDT 2024
% Result : Theorem 0.61s 0.81s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 143 ( 72 ~; 48 |; 20 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 58 ( 41 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f28,plain,
$false,
inference(resolution,[],[f26,f20]) ).
fof(f20,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox/tmp/tmp.lbqibN7VXy/Vampire---4.8_15376',reflexivity) ).
fof(f26,plain,
! [X0] : ~ r1(sK0,X0),
inference(subsumption_resolution,[],[f25,f17]) ).
fof(f17,plain,
! [X1] :
( ~ p1(sK2(X1))
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X1] :
( ( ! [X3] :
( p1(X3)
| ~ r1(sK1(X1),X3) )
& ~ p1(sK2(X1))
& r1(sK1(X1),sK2(X1))
& r1(X1,sK1(X1)) )
| ~ r1(sK0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f13,f12,f11]) ).
fof(f11,plain,
( ? [X0] :
! [X1] :
( ? [X2] :
( ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
& ? [X4] :
( ~ p1(X4)
& r1(X2,X4) )
& r1(X1,X2) )
| ~ r1(X0,X1) )
=> ! [X1] :
( ? [X2] :
( ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
& ? [X4] :
( ~ p1(X4)
& r1(X2,X4) )
& r1(X1,X2) )
| ~ r1(sK0,X1) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
! [X1] :
( ? [X2] :
( ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
& ? [X4] :
( ~ p1(X4)
& r1(X2,X4) )
& r1(X1,X2) )
=> ( ! [X3] :
( p1(X3)
| ~ r1(sK1(X1),X3) )
& ? [X4] :
( ~ p1(X4)
& r1(sK1(X1),X4) )
& r1(X1,sK1(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X1] :
( ? [X4] :
( ~ p1(X4)
& r1(sK1(X1),X4) )
=> ( ~ p1(sK2(X1))
& r1(sK1(X1),sK2(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
? [X0] :
! [X1] :
( ? [X2] :
( ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
& ? [X4] :
( ~ p1(X4)
& r1(X2,X4) )
& r1(X1,X2) )
| ~ r1(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
? [X0] :
! [X1] :
( ~ ! [X2] :
( ~ ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
| ! [X4] :
( p1(X4)
| ~ r1(X2,X4) )
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ),
inference(flattening,[],[f6]) ).
fof(f6,plain,
~ ~ ? [X0] :
~ ~ ! [X1] :
( ~ ! [X2] :
( ~ ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
| ! [X4] :
( p1(X4)
| ~ r1(X2,X4) )
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ),
inference(true_and_false_elimination,[],[f5]) ).
fof(f5,plain,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ ! [X2] :
( ~ ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
| ! [X4] :
( p1(X4)
| ~ r1(X2,X4) )
| ~ r1(X1,X2) )
| $false
| ~ r1(X0,X1) )
| $false ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ ! [X0] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ~ r1(X1,X0) )
| $false
| ~ r1(X0,X1) )
| $false ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
~ ? [X0] :
~ ( ~ ! [X1] :
( ~ ! [X0] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ~ r1(X1,X0) )
| $false
| ~ r1(X0,X1) )
| $false ),
file('/export/starexec/sandbox/tmp/tmp.lbqibN7VXy/Vampire---4.8_15376',main) ).
fof(f25,plain,
! [X0] :
( p1(sK2(X0))
| ~ r1(sK0,X0) ),
inference(duplicate_literal_removal,[],[f21]) ).
fof(f21,plain,
! [X0] :
( p1(sK2(X0))
| ~ r1(sK0,X0)
| ~ r1(sK0,X0) ),
inference(resolution,[],[f18,f16]) ).
fof(f16,plain,
! [X1] :
( r1(sK1(X1),sK2(X1))
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f18,plain,
! [X3,X1] :
( ~ r1(sK1(X1),X3)
| p1(X3)
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL678+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 13:47:21 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a FOF_THM_RFO_NEQ problem
% 0.12/0.33 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.lbqibN7VXy/Vampire---4.8_15376
% 0.61/0.81 % (15493)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.61/0.81 % (15490)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.61/0.81 % (15492)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.61/0.81 % (15488)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.61/0.81 % (15494)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.61/0.81 % (15491)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.61/0.81 % (15495)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.61/0.81 % (15487)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.61/0.81 % (15493)First to succeed.
% 0.61/0.81 % (15492)Also succeeded, but the first one will report.
% 0.61/0.81 % (15488)Also succeeded, but the first one will report.
% 0.61/0.81 % (15491)Also succeeded, but the first one will report.
% 0.61/0.81 % (15495)Also succeeded, but the first one will report.
% 0.61/0.81 % (15493)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-15484"
% 0.61/0.81 % (15490)Also succeeded, but the first one will report.
% 0.61/0.81 % (15494)Also succeeded, but the first one will report.
% 0.61/0.81 % (15487)Also succeeded, but the first one will report.
% 0.61/0.81 % (15493)Refutation found. Thanks to Tanya!
% 0.61/0.81 % SZS status Theorem for Vampire---4
% 0.61/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.81 % (15493)------------------------------
% 0.61/0.81 % (15493)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81 % (15493)Termination reason: Refutation
% 0.61/0.81
% 0.61/0.81 % (15493)Memory used [KB]: 973
% 0.61/0.81 % (15493)Time elapsed: 0.003 s
% 0.61/0.81 % (15493)Instructions burned: 3 (million)
% 0.61/0.81 % (15484)Success in time 0.471 s
% 0.61/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------