TSTP Solution File: LCL207-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL207-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 : n012.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:33:53 EDT 2024
% Result : Unsatisfiable 0.57s 0.76s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 12 ( 9 unt; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 19 ( 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f675,plain,
$false,
inference(unit_resulting_resolution,[],[f2,f35,f387,f8]) ).
fof(f8,axiom,
! [X3,X4,X5] :
( theorem(or(not(X3),X5))
| ~ axiom(or(not(X3),X4))
| ~ theorem(or(not(X4),X5)) ),
file('/export/starexec/sandbox/tmp/tmp.zCzhy0S0v2/Vampire---4.8_2607',rule_3) ).
fof(f387,plain,
! [X0,X1] : theorem(or(X0,or(not(X0),X1))),
inference(unit_resulting_resolution,[],[f4,f75,f7]) ).
fof(f7,axiom,
! [X3,X4] :
( theorem(X3)
| ~ axiom(or(not(X4),X3))
| ~ theorem(X4) ),
file('/export/starexec/sandbox/tmp/tmp.zCzhy0S0v2/Vampire---4.8_2607',rule_2) ).
fof(f75,plain,
! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
inference(unit_resulting_resolution,[],[f2,f12,f8]) ).
fof(f12,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(unit_resulting_resolution,[],[f3,f6]) ).
fof(f6,axiom,
! [X3] :
( theorem(X3)
| ~ axiom(X3) ),
file('/export/starexec/sandbox/tmp/tmp.zCzhy0S0v2/Vampire---4.8_2607',rule_1) ).
fof(f3,axiom,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox/tmp/tmp.zCzhy0S0v2/Vampire---4.8_2607',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/tmp/tmp.zCzhy0S0v2/Vampire---4.8_2607',axiom_1_5) ).
fof(f35,plain,
~ theorem(or(not(q),or(not(not(or(not(p),q))),p))),
inference(unit_resulting_resolution,[],[f9,f4,f7]) ).
fof(f9,axiom,
~ theorem(or(not(not(or(not(p),q))),or(not(q),p))),
file('/export/starexec/sandbox/tmp/tmp.zCzhy0S0v2/Vampire---4.8_2607',prove_this) ).
fof(f2,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox/tmp/tmp.zCzhy0S0v2/Vampire---4.8_2607',axiom_1_3) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : LCL207-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.16 % 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.15/0.37 % Computer : n012.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 13:43:10 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.15/0.37 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.zCzhy0S0v2/Vampire---4.8_2607
% 0.55/0.75 % (2723)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.55/0.75 % (2719)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.55/0.75 % (2720)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.55/0.75 % (2721)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.55/0.75 % (2716)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.55/0.75 % (2717)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.55/0.75 % (2722)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.57/0.76 % (2719)First to succeed.
% 0.57/0.76 % (2718)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.57/0.76 % (2719)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2715"
% 0.57/0.76 % (2719)Refutation found. Thanks to Tanya!
% 0.57/0.76 % SZS status Unsatisfiable for Vampire---4
% 0.57/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.76 % (2719)------------------------------
% 0.57/0.76 % (2719)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.76 % (2719)Termination reason: Refutation
% 0.57/0.76
% 0.57/0.76 % (2719)Memory used [KB]: 1273
% 0.57/0.76 % (2719)Time elapsed: 0.014 s
% 0.57/0.76 % (2719)Instructions burned: 27 (million)
% 0.57/0.76 % (2715)Success in time 0.386 s
% 0.57/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------