TSTP Solution File: LCL460+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL460+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n006.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:46:07 EDT 2024
% Result : Theorem 0.15s 0.32s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 22 ( 11 ~; 5 |; 0 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f168,plain,
$false,
inference(resolution,[],[f155,f151]) ).
fof(f151,plain,
~ is_a_theorem(implies(and(sK0,sK1),sK0)),
inference(subsumption_resolution,[],[f132,f107]) ).
fof(f107,plain,
~ kn2,
inference(cnf_transformation,[],[f55]) ).
fof(f55,plain,
~ kn2,
inference(flattening,[],[f54]) ).
fof(f54,negated_conjecture,
~ kn2,
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
kn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn2) ).
fof(f132,plain,
( kn2
| ~ is_a_theorem(implies(and(sK0,sK1),sK0)) ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,plain,
( kn2
| ~ is_a_theorem(implies(and(sK0,sK1),sK0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f88,f105]) ).
fof(f105,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(and(X0,X1),X0))
=> ~ is_a_theorem(implies(and(sK0,sK1),sK0)) ),
introduced(choice_axiom,[]) ).
fof(f88,plain,
( kn2
| ? [X0,X1] : ~ is_a_theorem(implies(and(X0,X1),X0)) ),
inference(ennf_transformation,[],[f67]) ).
fof(f67,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
=> kn2 ),
inference(unused_predicate_definition_removal,[],[f66]) ).
fof(f66,plain,
( kn2
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
( kn2
<=> ! [X3,X4] : is_a_theorem(implies(and(X3,X4),X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kn2) ).
fof(f155,plain,
! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
inference(subsumption_resolution,[],[f136,f120]) ).
fof(f120,plain,
and_1,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
and_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_and_1) ).
fof(f136,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(cnf_transformation,[],[f92]) ).
fof(f92,plain,
( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(ennf_transformation,[],[f76]) ).
fof(f76,plain,
( and_1
=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f7,axiom,
( and_1
<=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : LCL460+1 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.10 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.09/0.29 % Computer : n006.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Fri May 3 13:35:34 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 % (25527)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.31 % (25530)WARNING: value z3 for option sas not known
% 0.15/0.31 % (25531)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.31 % (25529)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.31 % (25528)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.31 % (25534)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.32 % (25533)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.32 % (25530)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.32 TRYING [1]
% 0.15/0.32 TRYING [2]
% 0.15/0.32 % (25534)First to succeed.
% 0.15/0.32 % (25533)Also succeeded, but the first one will report.
% 0.15/0.32 % (25532)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.32 % (25534)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-25527"
% 0.15/0.32 % (25534)Refutation found. Thanks to Tanya!
% 0.15/0.32 % SZS status Theorem for theBenchmark
% 0.15/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.32 % (25534)------------------------------
% 0.15/0.32 % (25534)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.32 % (25534)Termination reason: Refutation
% 0.15/0.32
% 0.15/0.32 % (25534)Memory used [KB]: 898
% 0.15/0.32 % (25534)Time elapsed: 0.003 s
% 0.15/0.32 % (25534)Instructions burned: 4 (million)
% 0.15/0.32 % (25527)Success in time 0.018 s
%------------------------------------------------------------------------------