TSTP Solution File: LCL107-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL107-1 : TPTP v8.2.0. Released v1.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 : n008.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:12:23 EDT 2024
% Result : Unsatisfiable 0.59s 0.80s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 14 unt; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 62 ( 62 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f146,plain,
$false,
inference(unit_resulting_resolution,[],[f126,f4,f126,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f4,plain,
! [X2,X0,X1] : ~ is_a_theorem(equivalent(equivalent(equivalent(b,e),equivalent(equivalent(a,b),c)),equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(X2,X1),equivalent(X2,X0)),equivalent(equivalent(a,e),c))))),
inference(unit_resulting_resolution,[],[f3,f2,f1]) ).
fof(f2,axiom,
! [X2,X3,X0,X1,X6,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X4),equivalent(equivalent(equivalent(X5,X4),equivalent(X5,X3)),X6))),equivalent(X2,equivalent(equivalent(X1,X0),X6)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_27_1690) ).
fof(f3,axiom,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p_1) ).
fof(f126,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
inference(unit_resulting_resolution,[],[f24,f100,f1]) ).
fof(f100,plain,
! [X0] : is_a_theorem(equivalent(X0,X0)),
inference(unit_resulting_resolution,[],[f41,f90,f1]) ).
fof(f90,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)),
inference(unit_resulting_resolution,[],[f57,f30,f1]) ).
fof(f30,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X3,equivalent(X4,X0)),equivalent(X3,equivalent(X4,equivalent(X1,X5))))),equivalent(X2,X5))),
inference(unit_resulting_resolution,[],[f19,f19,f1]) ).
fof(f19,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X4)))),equivalent(X0,equivalent(X3,X4))),X5),X5)),
inference(unit_resulting_resolution,[],[f12,f12,f1]) ).
fof(f12,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X4,X6))),equivalent(X3,equivalent(X5,X6))),X7)),equivalent(equivalent(X1,X2),X7))),
inference(unit_resulting_resolution,[],[f2,f7,f1]) ).
fof(f7,plain,
! [X2,X3,X0,X1,X6,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(X2,X1),equivalent(X2,X0)),X3)),equivalent(equivalent(equivalent(X4,X5),equivalent(equivalent(X6,X4),equivalent(X6,X5))),X3))),
inference(unit_resulting_resolution,[],[f2,f2,f1]) ).
fof(f57,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(equivalent(X3,X0),equivalent(equivalent(X4,X3),equivalent(X4,X1))),X2))),
inference(unit_resulting_resolution,[],[f12,f41,f1]) ).
fof(f41,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),X3),equivalent(equivalent(X0,equivalent(equivalent(X4,X1),equivalent(X4,X2))),X3))),
inference(unit_resulting_resolution,[],[f7,f24,f1]) ).
fof(f24,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4)))),equivalent(X0,equivalent(X1,X5))),equivalent(equivalent(X3,X4),X5))),
inference(unit_resulting_resolution,[],[f2,f19,f1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : LCL107-1 : TPTP v8.2.0. Released v1.0.0.
% 0.09/0.11 % 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.31 % Computer : n008.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon May 20 02:15:07 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.59/0.79 % (3681)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.59/0.79 % (3683)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.59/0.79 % (3682)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.59/0.79 % (3684)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.59/0.79 % (3685)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.59/0.79 % (3686)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.59/0.79 % (3687)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.59/0.79 % (3688)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.59/0.79 % (3686)Refutation not found, incomplete strategy% (3686)------------------------------
% 0.59/0.79 % (3686)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.79 % (3686)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.79 % (3685)Refutation not found, incomplete strategy% (3685)------------------------------
% 0.59/0.79 % (3685)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.79 % (3685)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.79
% 0.59/0.79 % (3685)Memory used [KB]: 961
% 0.59/0.79 % (3685)Time elapsed: 0.002 s
% 0.59/0.79 % (3685)Instructions burned: 2 (million)
% 0.59/0.79
% 0.59/0.79 % (3686)Memory used [KB]: 959
% 0.59/0.79 % (3686)Time elapsed: 0.002 s
% 0.59/0.79 % (3686)Instructions burned: 2 (million)
% 0.59/0.79 % (3685)------------------------------
% 0.59/0.79 % (3685)------------------------------
% 0.59/0.79 % (3686)------------------------------
% 0.59/0.79 % (3686)------------------------------
% 0.59/0.79 % (3688)Refutation not found, incomplete strategy% (3688)------------------------------
% 0.59/0.79 % (3688)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.79 % (3688)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.79
% 0.59/0.79 % (3688)Memory used [KB]: 959
% 0.59/0.79 % (3688)Time elapsed: 0.002 s
% 0.59/0.79 % (3688)Instructions burned: 2 (million)
% 0.59/0.79 % (3688)------------------------------
% 0.59/0.79 % (3688)------------------------------
% 0.59/0.80 % (3691)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2995ds/208Mi)
% 0.59/0.80 % (3689)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2995ds/55Mi)
% 0.59/0.80 % (3690)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2995ds/50Mi)
% 0.59/0.80 % (3689)First to succeed.
% 0.59/0.80 % (3689)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3676"
% 0.59/0.80 % (3689)Refutation found. Thanks to Tanya!
% 0.59/0.80 % SZS status Unsatisfiable for theBenchmark
% 0.59/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 0.59/0.80 % (3689)------------------------------
% 0.59/0.80 % (3689)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.80 % (3689)Termination reason: Refutation
% 0.59/0.80
% 0.59/0.80 % (3689)Memory used [KB]: 1076
% 0.59/0.80 % (3689)Time elapsed: 0.008 s
% 0.59/0.80 % (3689)Instructions burned: 14 (million)
% 0.59/0.80 % (3676)Success in time 0.487 s
% 0.59/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------