TSTP Solution File: LCL035-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL035-1 : TPTP v8.1.2. 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.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:32:48 EDT 2024
% Result : Unsatisfiable 0.58s 0.75s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 36 ( 18 ~; 15 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f84,plain,
$false,
inference(avatar_sat_refutation,[],[f50,f60,f80,f83]) ).
fof(f83,plain,
~ spl0_5,
inference(avatar_contradiction_clause,[],[f81]) ).
fof(f81,plain,
( $false
| ~ spl0_5 ),
inference(resolution,[],[f59,f3]) ).
fof(f3,axiom,
~ is_a_theorem(implies(falsehood,a)),
file('/export/starexec/sandbox/tmp/tmp.VHEqzcnVzN/Vampire---4.8_23499',prove_c0_4) ).
fof(f59,plain,
( ! [X1] : is_a_theorem(implies(falsehood,X1))
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f58]) ).
fof(f58,plain,
( spl0_5
<=> ! [X1] : is_a_theorem(implies(falsehood,X1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
fof(f80,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f61]) ).
fof(f61,plain,
( $false
| ~ spl0_4 ),
inference(resolution,[],[f49,f2]) ).
fof(f2,axiom,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(implies(X0,X1),implies(X2,falsehood)),X3),X4),implies(implies(X4,X0),implies(X2,X0)))),
file('/export/starexec/sandbox/tmp/tmp.VHEqzcnVzN/Vampire---4.8_23499',c0_CAMerideth) ).
fof(f49,plain,
( ! [X0] : ~ is_a_theorem(X0)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f48,plain,
( spl0_4
<=> ! [X0] : ~ is_a_theorem(X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f60,plain,
( spl0_5
| spl0_4
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f51,f45,f48,f58]) ).
fof(f45,plain,
( spl0_3
<=> ! [X2,X1] : is_a_theorem(implies(X1,implies(falsehood,X2))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f51,plain,
( ! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(falsehood,X1)) )
| ~ spl0_3 ),
inference(resolution,[],[f46,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.VHEqzcnVzN/Vampire---4.8_23499',condensed_detachment) ).
fof(f46,plain,
( ! [X2,X1] : is_a_theorem(implies(X1,implies(falsehood,X2)))
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f50,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f38,f48,f45]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,implies(falsehood,X2))) ),
inference(resolution,[],[f30,f1]) ).
fof(f30,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(falsehood,X2)))),
inference(resolution,[],[f9,f5]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))),
inference(resolution,[],[f4,f2]) ).
fof(f4,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,falsehood)),X3),X4))
| is_a_theorem(implies(implies(X4,X0),implies(X2,X0))) ),
inference(resolution,[],[f2,f1]) ).
fof(f9,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X0,implies(falsehood,X1)),X2))
| is_a_theorem(implies(X3,X2)) ),
inference(resolution,[],[f6,f1]) ).
fof(f6,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(falsehood,X1)),X2),implies(X3,X2))),
inference(resolution,[],[f5,f4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL035-1 : TPTP v8.1.2. Released v1.0.0.
% 0.15/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.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 13:26:31 EDT 2024
% 0.22/0.36 % CPUTime :
% 0.22/0.36 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.22/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.VHEqzcnVzN/Vampire---4.8_23499
% 0.58/0.75 % (23921)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.58/0.75 % (23921)Refutation not found, incomplete strategy% (23921)------------------------------
% 0.58/0.75 % (23921)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (23921)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.75
% 0.58/0.75 % (23921)Memory used [KB]: 958
% 0.58/0.75 % (23921)Time elapsed: 0.001 s
% 0.58/0.75 % (23921)Instructions burned: 2 (million)
% 0.58/0.75 % (23921)------------------------------
% 0.58/0.75 % (23921)------------------------------
% 0.58/0.75 % (23914)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.58/0.75 % (23916)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.58/0.75 % (23915)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.58/0.75 % (23918)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.58/0.75 % (23919)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.58/0.75 % (23917)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.58/0.75 % (23919)Refutation not found, incomplete strategy% (23919)------------------------------
% 0.58/0.75 % (23919)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (23919)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.75 % (23918)Refutation not found, incomplete strategy% (23918)------------------------------
% 0.58/0.75 % (23918)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75
% 0.58/0.75 % (23918)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.75
% 0.58/0.75 % (23918)Memory used [KB]: 960
% 0.58/0.75 % (23918)Time elapsed: 0.002 s
% 0.58/0.75 % (23918)Instructions burned: 2 (million)
% 0.58/0.75 % (23920)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.58/0.75 % (23919)Memory used [KB]: 958
% 0.58/0.75 % (23919)Time elapsed: 0.002 s
% 0.58/0.75 % (23919)Instructions burned: 2 (million)
% 0.58/0.75 % (23918)------------------------------
% 0.58/0.75 % (23918)------------------------------
% 0.58/0.75 % (23919)------------------------------
% 0.58/0.75 % (23919)------------------------------
% 0.58/0.75 % (23917)Also succeeded, but the first one will report.
% 0.58/0.75 % (23915)First to succeed.
% 0.58/0.75 % (23922)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 Vampire---4 for (2996ds/55Mi)
% 0.58/0.75 % (23914)Also succeeded, but the first one will report.
% 0.58/0.75 % (23915)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23768"
% 0.58/0.75 % (23922)Also succeeded, but the first one will report.
% 0.58/0.75 % (23915)Refutation found. Thanks to Tanya!
% 0.58/0.75 % SZS status Unsatisfiable for Vampire---4
% 0.58/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.75 % (23915)------------------------------
% 0.58/0.75 % (23915)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (23915)Termination reason: Refutation
% 0.58/0.75
% 0.58/0.75 % (23915)Memory used [KB]: 1001
% 0.58/0.75 % (23915)Time elapsed: 0.004 s
% 0.58/0.75 % (23915)Instructions burned: 4 (million)
% 0.58/0.75 % (23768)Success in time 0.382 s
% 0.58/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------