TSTP Solution File: LCL203-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL203-1 : TPTP v8.2.0. 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 : n016.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 : Tue May 21 00:13:07 EDT 2024
% Result : Unsatisfiable 0.60s 0.79s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 18 ~; 12 |; 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f194,plain,
$false,
inference(resolution,[],[f132,f159]) ).
fof(f159,plain,
! [X0] : ~ theorem(or(not(or(X0,q)),not(not(or(p,q))))),
inference(resolution,[],[f72,f2]) ).
fof(f2,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f72,plain,
! [X0] :
( ~ axiom(or(not(q),X0))
| ~ theorem(or(not(X0),not(not(or(p,q))))) ),
inference(resolution,[],[f53,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/benchmark/theBenchmark.p',rule_3) ).
fof(f53,plain,
~ theorem(or(not(q),not(not(or(p,q))))),
inference(forward_literal_rewriting,[],[f50,f12]) ).
fof(f12,plain,
! [X0,X1] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f7,f3]) ).
fof(f3,axiom,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f7,axiom,
! [X3,X4] :
( ~ axiom(or(not(X4),X3))
| ~ theorem(X4)
| theorem(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f50,plain,
~ theorem(or(not(not(or(p,q))),not(q))),
inference(resolution,[],[f37,f13]) ).
fof(f13,plain,
! [X0,X1] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(resolution,[],[f7,f2]) ).
fof(f37,plain,
~ theorem(or(not(p),or(not(not(or(p,q))),not(q)))),
inference(resolution,[],[f15,f9]) ).
fof(f9,axiom,
~ theorem(or(not(not(or(p,q))),or(not(p),not(q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f15,plain,
! [X2,X0,X1] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f4,f7]) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f132,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(forward_literal_rewriting,[],[f131,f12]) ).
fof(f131,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f81,f2]) ).
fof(f81,plain,
! [X0,X1] :
( ~ axiom(or(X0,or(or(X0,X1),X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f39,f6]) ).
fof(f6,axiom,
! [X3] :
( theorem(X3)
| ~ axiom(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f39,plain,
! [X0,X1] :
( ~ theorem(or(X0,or(or(X0,X1),X1)))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f15,f11]) ).
fof(f11,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f7,f1]) ).
fof(f1,axiom,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : LCL203-1 : TPTP v8.2.0. Released v1.1.0.
% 0.02/0.10 % 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.10/0.30 % Computer : n016.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 03:25:07 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.10/0.31 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/benchmark/theBenchmark.p
% 0.60/0.78 % (14473)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.60/0.78 % (14472)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.78 % (14474)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 theBenchmark for (2995ds/34Mi)
% 0.60/0.78 % (14470)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 theBenchmark for (2995ds/34Mi)
% 0.60/0.78 % (14475)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.60/0.78 % (14471)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 theBenchmark for (2995ds/51Mi)
% 0.60/0.78 % (14476)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 theBenchmark for (2995ds/83Mi)
% 0.60/0.78 % (14477)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.60/0.79 % (14470)First to succeed.
% 0.60/0.79 % (14470)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-14468"
% 0.60/0.79 % (14470)Refutation found. Thanks to Tanya!
% 0.60/0.79 % SZS status Unsatisfiable for theBenchmark
% 0.60/0.79 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.79 % (14470)------------------------------
% 0.60/0.79 % (14470)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79 % (14470)Termination reason: Refutation
% 0.60/0.79
% 0.60/0.79 % (14470)Memory used [KB]: 1089
% 0.60/0.79 % (14470)Time elapsed: 0.010 s
% 0.60/0.79 % (14470)Instructions burned: 14 (million)
% 0.60/0.79 % (14468)Success in time 0.473 s
% 0.60/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------