TSTP Solution File: LCL193-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL193-1 : TPTP v8.1.2. Released v1.1.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 : n023.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:11:23 EDT 2024
% Result : Unsatisfiable 0.56s 0.75s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 9 ( 6 unt; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f182,plain,
$false,
inference(unit_resulting_resolution,[],[f3,f94,f6]) ).
fof(f6,axiom,
! [X3] :
( theorem(X3)
| ~ axiom(X3) ),
file('/export/starexec/sandbox/tmp/tmp.xZxHViLxIo/Vampire---4.8_30099',rule_1) ).
fof(f94,plain,
~ theorem(or(not(or(p,r)),or(r,p))),
inference(unit_resulting_resolution,[],[f5,f10,f7]) ).
fof(f7,axiom,
! [X3,X4] :
( ~ axiom(or(not(X4),X3))
| ~ theorem(X4)
| theorem(X3) ),
file('/export/starexec/sandbox/tmp/tmp.xZxHViLxIo/Vampire---4.8_30099',rule_2) ).
fof(f10,plain,
! [X0] : ~ theorem(or(not(or(not(or(X0,q)),or(X0,r))),or(not(or(p,q)),or(r,p)))),
inference(unit_resulting_resolution,[],[f5,f9,f8]) ).
fof(f8,axiom,
! [X3,X4,X5] :
( ~ axiom(or(not(X3),X4))
| ~ theorem(or(not(X4),X5))
| theorem(or(not(X3),X5)) ),
file('/export/starexec/sandbox/tmp/tmp.xZxHViLxIo/Vampire---4.8_30099',rule_3) ).
fof(f9,axiom,
~ theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))),
file('/export/starexec/sandbox/tmp/tmp.xZxHViLxIo/Vampire---4.8_30099',prove_this) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox/tmp/tmp.xZxHViLxIo/Vampire---4.8_30099',axiom_1_6) ).
fof(f3,axiom,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox/tmp/tmp.xZxHViLxIo/Vampire---4.8_30099',axiom_1_4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL193-1 : TPTP v8.1.2. Released v1.1.0.
% 0.13/0.15 % 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.16/0.36 % Computer : n023.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Apr 30 16:59:25 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.16/0.36 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.xZxHViLxIo/Vampire---4.8_30099
% 0.56/0.75 % (30358)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 (2996ds/83Mi)
% 0.56/0.75 % (30359)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 (2996ds/56Mi)
% 0.56/0.75 % (30352)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 (2996ds/34Mi)
% 0.56/0.75 % (30354)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.56/0.75 % (30353)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 (2996ds/51Mi)
% 0.56/0.75 % (30355)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.56/0.75 % (30357)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.56/0.75 % (30356)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 (2996ds/34Mi)
% 0.56/0.75 % (30358)First to succeed.
% 0.56/0.75 % (30356)Also succeeded, but the first one will report.
% 0.56/0.75 % (30354)Also succeeded, but the first one will report.
% 0.56/0.75 % (30358)Refutation found. Thanks to Tanya!
% 0.56/0.75 % SZS status Unsatisfiable for Vampire---4
% 0.56/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.75 % (30358)------------------------------
% 0.56/0.75 % (30358)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.75 % (30358)Termination reason: Refutation
% 0.56/0.75
% 0.56/0.75 % (30358)Memory used [KB]: 1059
% 0.56/0.75 % (30358)Time elapsed: 0.004 s
% 0.56/0.75 % (30358)Instructions burned: 7 (million)
% 0.56/0.75 % (30358)------------------------------
% 0.56/0.75 % (30358)------------------------------
% 0.56/0.76 % (30348)Success in time 0.386 s
% 0.56/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------