TSTP Solution File: LCL097-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL097-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 : 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 : Tue May 21 00:12:20 EDT 2024
% Result : Unsatisfiable 0.54s 0.70s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 9 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 12 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 41 ( 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f83,plain,
$false,
inference(subsumption_resolution,[],[f78,f10]) ).
fof(f10,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3))),
inference(resolution,[],[f7,f6]) ).
fof(f6,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4))
| is_a_theorem(X4) ),
inference(resolution,[],[f3,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(f3,axiom,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_3) ).
fof(f7,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
inference(resolution,[],[f6,f2]) ).
fof(f2,axiom,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_2) ).
fof(f78,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,falsehood)),e),equivalent(equivalent(b,falsehood),e))),
inference(resolution,[],[f56,f10]) ).
fof(f56,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(a,b),c)),X1),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))
| ~ is_a_theorem(equivalent(equivalent(X0,e),X1)) ),
inference(resolution,[],[f29,f35]) ).
fof(f35,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(a,b),c)),equivalent(X0,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
inference(resolution,[],[f18,f4]) ).
fof(f4,axiom,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lg_4) ).
fof(f18,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3)) ),
inference(resolution,[],[f10,f1]) ).
fof(f29,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X3),X2))
| ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(resolution,[],[f14,f1]) ).
fof(f14,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(resolution,[],[f8,f1]) ).
fof(f8,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))),
inference(resolution,[],[f6,f3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL097-1 : TPTP v8.2.0. Released v1.0.0.
% 0.06/0.12 % 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.13/0.31 % Computer : n012.cluster.edu
% 0.13/0.31 % Model : x86_64 x86_64
% 0.13/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31 % Memory : 8042.1875MB
% 0.13/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31 % CPULimit : 300
% 0.13/0.31 % WCLimit : 300
% 0.13/0.31 % DateTime : Mon May 20 02:39:08 EDT 2024
% 0.13/0.31 % CPUTime :
% 0.13/0.31 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.13/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.54/0.69 % (12234)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 (2996ds/56Mi)
% 0.54/0.69 % (12234)Refutation not found, incomplete strategy% (12234)------------------------------
% 0.54/0.69 % (12234)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.69 % (12234)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.69
% 0.54/0.69 % (12234)Memory used [KB]: 960
% 0.54/0.69 % (12234)Time elapsed: 0.001 s
% 0.54/0.69 % (12234)Instructions burned: 2 (million)
% 0.54/0.69 % (12234)------------------------------
% 0.54/0.69 % (12234)------------------------------
% 0.54/0.69 % (12227)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 (2996ds/34Mi)
% 0.54/0.69 % (12229)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.69 % (12228)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 (2996ds/51Mi)
% 0.54/0.69 % (12230)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.54/0.69 % (12232)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.54/0.69 % (12231)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 (2996ds/34Mi)
% 0.54/0.69 % (12233)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 (2996ds/83Mi)
% 0.54/0.70 % (12232)Refutation not found, incomplete strategy% (12232)------------------------------
% 0.54/0.70 % (12232)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.70 % (12232)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.70
% 0.54/0.70 % (12232)Memory used [KB]: 960
% 0.54/0.70 % (12232)Time elapsed: 0.002 s
% 0.54/0.70 % (12232)Instructions burned: 2 (million)
% 0.54/0.70 % (12231)Refutation not found, incomplete strategy% (12231)------------------------------
% 0.54/0.70 % (12231)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.70 % (12231)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.70
% 0.54/0.70 % (12231)Memory used [KB]: 961
% 0.54/0.70 % (12231)Time elapsed: 0.002 s
% 0.54/0.70 % (12231)Instructions burned: 2 (million)
% 0.54/0.70 % (12232)------------------------------
% 0.54/0.70 % (12232)------------------------------
% 0.54/0.70 % (12231)------------------------------
% 0.54/0.70 % (12231)------------------------------
% 0.54/0.70 % (12235)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 (2996ds/55Mi)
% 0.54/0.70 % (12229)First to succeed.
% 0.54/0.70 % (12236)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 (2996ds/50Mi)
% 0.54/0.70 % (12229)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12071"
% 0.54/0.70 % (12237)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 (2996ds/208Mi)
% 0.54/0.70 % (12229)Refutation found. Thanks to Tanya!
% 0.54/0.70 % SZS status Unsatisfiable for theBenchmark
% 0.54/0.70 % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.70 % (12229)------------------------------
% 0.54/0.70 % (12229)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.70 % (12229)Termination reason: Refutation
% 0.54/0.70
% 0.54/0.70 % (12229)Memory used [KB]: 1060
% 0.54/0.70 % (12229)Time elapsed: 0.007 s
% 0.54/0.70 % (12229)Instructions burned: 9 (million)
% 0.54/0.70 % (12071)Success in time 0.379 s
% 0.54/0.70 % Vampire---4.8 exiting
%------------------------------------------------------------------------------