TSTP Solution File: LCL130-1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL130-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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.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 : Wed May 1 03:11:01 EDT 2024
% Result : Unsatisfiable 0.61s 0.81s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 44 ( 25 ~; 18 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 35 ( 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f62,plain,
$false,
inference(avatar_sat_refutation,[],[f15,f61]) ).
fof(f61,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f59]) ).
fof(f59,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f49,f2]) ).
fof(f2,axiom,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),X0)),
file('/export/starexec/sandbox2/tmp/tmp.iozbBa1cDd/Vampire---4.8_5231',p_4) ).
fof(f49,plain,
( ! [X0] : ~ is_a_theorem(equivalent(X0,a))
| ~ spl0_1 ),
inference(duplicate_literal_removal,[],[f48]) ).
fof(f48,plain,
( ! [X0] :
( ~ is_a_theorem(equivalent(X0,a))
| ~ is_a_theorem(equivalent(X0,a)) )
| ~ spl0_1 ),
inference(resolution,[],[f36,f20]) ).
fof(f20,plain,
( ! [X2,X0,X1] :
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X0,X2))
| ~ is_a_theorem(equivalent(X0,X1)) )
| ~ spl0_1 ),
inference(resolution,[],[f16,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.iozbBa1cDd/Vampire---4.8_5231',condensed_detachment) ).
fof(f16,plain,
( ! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X2),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,X1)) )
| ~ spl0_1 ),
inference(resolution,[],[f10,f1]) ).
fof(f10,plain,
( ! [X3,X4,X5] : is_a_theorem(equivalent(equivalent(X3,X4),equivalent(equivalent(X3,X5),equivalent(X4,X5))))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f9]) ).
fof(f9,plain,
( spl0_1
<=> ! [X4,X5,X3] : is_a_theorem(equivalent(equivalent(X3,X4),equivalent(equivalent(X3,X5),equivalent(X4,X5)))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f36,plain,
( ~ is_a_theorem(equivalent(a,a))
| ~ spl0_1 ),
inference(resolution,[],[f25,f2]) ).
fof(f25,plain,
( ! [X0] :
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),a))
| ~ is_a_theorem(equivalent(X0,a)) )
| ~ spl0_1 ),
inference(resolution,[],[f21,f16]) ).
fof(f21,plain,
( ! [X0] :
( ~ is_a_theorem(equivalent(X0,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X0,a)) )
| ~ spl0_1 ),
inference(resolution,[],[f20,f3]) ).
fof(f3,axiom,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
file('/export/starexec/sandbox2/tmp/tmp.iozbBa1cDd/Vampire---4.8_5231',prove_lg_2) ).
fof(f15,plain,
spl0_1,
inference(avatar_split_clause,[],[f6,f9]) ).
fof(f6,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2)))),
inference(resolution,[],[f5,f4]) ).
fof(f4,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))))
| is_a_theorem(X0) ),
inference(resolution,[],[f2,f1]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),equivalent(X1,X2))),equivalent(equivalent(X3,X4),equivalent(equivalent(X3,X5),equivalent(X4,X5))))),
inference(resolution,[],[f4,f2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL130-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.15 % 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.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 16:38:04 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.14/0.36 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/tmp/tmp.iozbBa1cDd/Vampire---4.8_5231
% 0.61/0.80 % (5418)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 (2995ds/34Mi)
% 0.61/0.80 % (5420)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.80 % (5424)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 (2995ds/83Mi)
% 0.61/0.80 % (5419)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 (2995ds/51Mi)
% 0.61/0.80 % (5421)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.80 % (5422)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 (2995ds/34Mi)
% 0.61/0.80 % (5423)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.80 % (5422)Refutation not found, incomplete strategy% (5422)------------------------------
% 0.61/0.80 % (5422)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (5422)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80 % (5423)Refutation not found, incomplete strategy% (5423)------------------------------
% 0.61/0.80 % (5423)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (5423)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (5423)Memory used [KB]: 958
% 0.61/0.80 % (5423)Time elapsed: 0.002 s
% 0.61/0.80 % (5423)Instructions burned: 2 (million)
% 0.61/0.80 % (5423)------------------------------
% 0.61/0.80 % (5423)------------------------------
% 0.61/0.80
% 0.61/0.80 % (5422)Memory used [KB]: 960
% 0.61/0.80 % (5422)Time elapsed: 0.002 s
% 0.61/0.80 % (5422)Instructions burned: 2 (million)
% 0.61/0.80 % (5422)------------------------------
% 0.61/0.80 % (5422)------------------------------
% 0.61/0.80 % (5425)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 (2995ds/56Mi)
% 0.61/0.80 % (5425)Refutation not found, incomplete strategy% (5425)------------------------------
% 0.61/0.80 % (5425)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (5425)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (5425)Memory used [KB]: 958
% 0.61/0.80 % (5425)Time elapsed: 0.003 s
% 0.61/0.80 % (5425)Instructions burned: 2 (million)
% 0.61/0.80 % (5425)------------------------------
% 0.61/0.80 % (5425)------------------------------
% 0.61/0.80 % (5418)First to succeed.
% 0.61/0.81 % (5418)Refutation found. Thanks to Tanya!
% 0.61/0.81 % SZS status Unsatisfiable for Vampire---4
% 0.61/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.81 % (5418)------------------------------
% 0.61/0.81 % (5418)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.81 % (5418)Termination reason: Refutation
% 0.61/0.81
% 0.61/0.81 % (5418)Memory used [KB]: 992
% 0.61/0.81 % (5418)Time elapsed: 0.006 s
% 0.61/0.81 % (5418)Instructions burned: 6 (million)
% 0.61/0.81 % (5418)------------------------------
% 0.61/0.81 % (5418)------------------------------
% 0.61/0.81 % (5382)Success in time 0.434 s
% 0.61/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------