TSTP Solution File: LCL452+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL452+1 : TPTP v8.2.0. 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 : Tue May 21 00:26:58 EDT 2024
% Result : Theorem 0.21s 0.41s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 16 unt; 0 def)
% Number of atoms : 52 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 36 ( 18 ~; 10 |; 0 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 32 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f190,plain,
$false,
inference(resolution,[],[f188,f117]) ).
fof(f117,plain,
or_1,
inference(cnf_transformation,[],[f43]) ).
fof(f43,axiom,
or_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_or_1) ).
fof(f188,plain,
~ or_1,
inference(resolution,[],[f174,f133]) ).
fof(f133,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(ennf_transformation,[],[f73]) ).
fof(f73,plain,
( or_1
=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f10,axiom,
( or_1
<=> ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',or_1) ).
fof(f174,plain,
~ is_a_theorem(implies(sK0,or(sK0,sK1))),
inference(backward_demodulation,[],[f148,f172]) ).
fof(f172,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(resolution,[],[f163,f125]) ).
fof(f125,plain,
op_or,
inference(cnf_transformation,[],[f50]) ).
fof(f50,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_op_or) ).
fof(f163,plain,
! [X0,X1] :
( ~ op_or
| or(X0,X1) = implies(not(X0),X1) ),
inference(backward_demodulation,[],[f130,f162]) ).
fof(f162,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(resolution,[],[f129,f124]) ).
fof(f124,plain,
op_implies_and,
inference(cnf_transformation,[],[f33]) ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f129,plain,
! [X0,X1] :
( ~ op_implies_and
| implies(X0,X1) = not(and(X0,not(X1))) ),
inference(cnf_transformation,[],[f86]) ).
fof(f86,plain,
( ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,axiom,
( op_implies_and
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_and) ).
fof(f130,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f87]) ).
fof(f87,plain,
( ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(ennf_transformation,[],[f27]) ).
fof(f27,axiom,
( op_or
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_or) ).
fof(f148,plain,
~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))),
inference(resolution,[],[f132,f108]) ).
fof(f108,plain,
~ cn2,
inference(cnf_transformation,[],[f55]) ).
fof(f55,plain,
~ cn2,
inference(flattening,[],[f54]) ).
fof(f54,negated_conjecture,
~ cn2,
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
cn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).
fof(f132,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f89,f106]) ).
fof(f106,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1)))
=> ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
introduced(choice_axiom,[]) ).
fof(f89,plain,
( cn2
| ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(ennf_transformation,[],[f67]) ).
fof(f67,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
=> cn2 ),
inference(unused_predicate_definition_removal,[],[f66]) ).
fof(f66,plain,
( cn2
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(rectify,[],[f20]) ).
fof(f20,axiom,
( cn2
<=> ! [X3,X4] : is_a_theorem(implies(X3,implies(not(X3),X4))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL452+1 : TPTP v8.2.0. Released v3.3.0.
% 0.03/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n006.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 : Mon May 20 03:30:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.36 % (23306)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.39 % (23309)WARNING: value z3 for option sas not known
% 0.21/0.40 % (23308)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.40 % (23307)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.40 % (23310)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.40 % (23313)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.21/0.40 % (23309)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.21/0.40 % (23311)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.21/0.40 % (23312)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.21/0.40 TRYING [1]
% 0.21/0.40 TRYING [2]
% 0.21/0.40 % (23312)First to succeed.
% 0.21/0.40 % (23309)Also succeeded, but the first one will report.
% 0.21/0.40 % (23312)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23306"
% 0.21/0.41 TRYING [1]
% 0.21/0.41 TRYING [2]
% 0.21/0.41 % (23312)Refutation found. Thanks to Tanya!
% 0.21/0.41 % SZS status Theorem for theBenchmark
% 0.21/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.41 % (23312)------------------------------
% 0.21/0.41 % (23312)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.41 % (23312)Termination reason: Refutation
% 0.21/0.41
% 0.21/0.41 % (23312)Memory used [KB]: 916
% 0.21/0.41 % (23312)Time elapsed: 0.010 s
% 0.21/0.41 % (23312)Instructions burned: 7 (million)
% 0.21/0.41 % (23306)Success in time 0.041 s
%------------------------------------------------------------------------------