TSTP Solution File: LCL497+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL497+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 : n016.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:27:10 EDT 2024
% Result : Theorem 7.83s 1.52s
% Output : Refutation 7.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 73 ( 36 unt; 0 def)
% Number of atoms : 121 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 80 ( 32 ~; 25 |; 2 &)
% ( 11 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 108 ( 104 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f73271,plain,
$false,
inference(unit_resulting_resolution,[],[f952,f73265,f141]) ).
fof(f141,plain,
! [X0,X1] :
( ~ is_a_theorem(or(X1,X0))
| is_a_theorem(or(X0,X1)) ),
inference(resolution,[],[f119,f117]) ).
fof(f117,plain,
! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))),
inference(subsumption_resolution,[],[f104,f88]) ).
fof(f88,plain,
r3,
inference(cnf_transformation,[],[f38]) ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r3) ).
fof(f104,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(cnf_transformation,[],[f76]) ).
fof(f76,plain,
( ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(ennf_transformation,[],[f61]) ).
fof(f61,plain,
( r3
=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f56]) ).
fof(f56,plain,
( r3
<=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(rectify,[],[f24]) ).
fof(f24,axiom,
( r3
<=> ! [X3,X4] : is_a_theorem(implies(or(X3,X4),or(X4,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r3) ).
fof(f119,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(subsumption_resolution,[],[f106,f86]) ).
fof(f86,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_modus_ponens) ).
fof(f106,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[],[f79]) ).
fof(f79,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(flattening,[],[f78]) ).
fof(f78,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f66]) ).
fof(f66,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
fof(f73265,plain,
! [X0,X1] : is_a_theorem(or(X0,implies(X0,X1))),
inference(forward_demodulation,[],[f72812,f109]) ).
fof(f109,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(subsumption_resolution,[],[f97,f93]) ).
fof(f93,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).
fof(f97,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(cnf_transformation,[],[f69]) ).
fof(f69,plain,
( ! [X0,X1] : implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_implies_or) ).
fof(f72812,plain,
! [X0,X1] : is_a_theorem(or(X0,or(not(X0),X1))),
inference(unit_resulting_resolution,[],[f14391,f10962,f119]) ).
fof(f10962,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X0,or(X2,X1)))),
inference(unit_resulting_resolution,[],[f117,f120,f119]) ).
fof(f120,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))),
inference(subsumption_resolution,[],[f107,f87]) ).
fof(f87,plain,
r5,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
r5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r5) ).
fof(f107,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(cnf_transformation,[],[f80]) ).
fof(f80,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(ennf_transformation,[],[f59]) ).
fof(f59,plain,
( r5
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f57]) ).
fof(f57,plain,
( r5
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
inference(rectify,[],[f26]) ).
fof(f26,axiom,
( r5
<=> ! [X3,X4,X5] : is_a_theorem(implies(implies(X4,X5),implies(or(X3,X4),or(X3,X5)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r5) ).
fof(f14391,plain,
! [X0,X1] : is_a_theorem(or(X0,or(X1,not(X0)))),
inference(unit_resulting_resolution,[],[f117,f14238,f119]) ).
fof(f14238,plain,
! [X0,X1] : is_a_theorem(or(or(X0,not(X1)),X1)),
inference(unit_resulting_resolution,[],[f10961,f13321,f119]) ).
fof(f13321,plain,
! [X2,X0,X1] : is_a_theorem(or(or(X0,not(X1)),or(X2,X1))),
inference(unit_resulting_resolution,[],[f117,f11985,f119]) ).
fof(f11985,plain,
! [X2,X0,X1] : is_a_theorem(or(or(X0,X1),or(X2,not(X1)))),
inference(unit_resulting_resolution,[],[f465,f10964,f119]) ).
fof(f10964,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X0,X1),or(X0,or(X2,X1)))),
inference(unit_resulting_resolution,[],[f116,f120,f119]) ).
fof(f116,plain,
! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))),
inference(subsumption_resolution,[],[f103,f90]) ).
fof(f90,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r2) ).
fof(f103,plain,
! [X0,X1] :
( is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(cnf_transformation,[],[f75]) ).
fof(f75,plain,
( ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1)))
| ~ r2 ),
inference(ennf_transformation,[],[f62]) ).
fof(f62,plain,
( r2
=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f55,plain,
( r2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(rectify,[],[f23]) ).
fof(f23,axiom,
( r2
<=> ! [X3,X4] : is_a_theorem(implies(X4,or(X3,X4))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r2) ).
fof(f465,plain,
! [X0,X1] : is_a_theorem(or(or(X0,X1),not(X1))),
inference(unit_resulting_resolution,[],[f116,f124,f119]) ).
fof(f124,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),or(X1,not(X0)))),
inference(superposition,[],[f117,f109]) ).
fof(f10961,plain,
! [X0,X1] : is_a_theorem(implies(or(X0,or(X1,X1)),or(X0,X1))),
inference(unit_resulting_resolution,[],[f115,f120,f119]) ).
fof(f115,plain,
! [X0] : is_a_theorem(implies(or(X0,X0),X0)),
inference(subsumption_resolution,[],[f102,f85]) ).
fof(f85,plain,
r1,
inference(cnf_transformation,[],[f36]) ).
fof(f36,axiom,
r1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r1) ).
fof(f102,plain,
! [X0] :
( is_a_theorem(implies(or(X0,X0),X0))
| ~ r1 ),
inference(cnf_transformation,[],[f74]) ).
fof(f74,plain,
( ! [X0] : is_a_theorem(implies(or(X0,X0),X0))
| ~ r1 ),
inference(ennf_transformation,[],[f63]) ).
fof(f63,plain,
( r1
=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f54]) ).
fof(f54,plain,
( r1
<=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
inference(rectify,[],[f22]) ).
fof(f22,axiom,
( r1
<=> ! [X3] : is_a_theorem(implies(or(X3,X3),X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',r1) ).
fof(f952,plain,
~ is_a_theorem(or(implies(not(sK0),sK1),not(sK0))),
inference(unit_resulting_resolution,[],[f114,f125,f119]) ).
fof(f125,plain,
! [X0,X1] : is_a_theorem(implies(or(X1,not(X0)),implies(X0,X1))),
inference(superposition,[],[f117,f109]) ).
fof(f114,plain,
~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))),
inference(subsumption_resolution,[],[f101,f84]) ).
fof(f84,plain,
~ cn2,
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
~ cn2,
inference(flattening,[],[f46]) ).
fof(f46,negated_conjecture,
~ cn2,
inference(negated_conjecture,[],[f45]) ).
fof(f45,conjecture,
cn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).
fof(f101,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(cnf_transformation,[],[f83]) ).
fof(f83,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f73,f82]) ).
fof(f82,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(f73,plain,
( cn2
| ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(ennf_transformation,[],[f64]) ).
fof(f64,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
=> cn2 ),
inference(unused_predicate_definition_removal,[],[f53]) ).
fof(f53,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.07/0.12 % Problem : LCL497+1 : TPTP v8.2.0. Released v3.3.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 00:57:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % (26274)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (26277)WARNING: value z3 for option sas not known
% 0.15/0.38 % (26275)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (26277)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.38 % (26278)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (26280)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.38 % (26276)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (26281)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.38 % (26279)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.38 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [3]
% 0.15/0.38 TRYING [2]
% 0.21/0.39 TRYING [3]
% 0.21/0.40 TRYING [4]
% 0.21/0.42 TRYING [4]
% 0.21/0.46 TRYING [5]
% 1.26/0.53 TRYING [5]
% 1.40/0.58 TRYING [6]
% 5.21/1.09 TRYING [7]
% 5.21/1.12 TRYING [6]
% 7.83/1.48 TRYING [1]
% 7.83/1.48 TRYING [2]
% 7.83/1.48 TRYING [3]
% 7.83/1.49 TRYING [4]
% 7.83/1.51 % (26281)First to succeed.
% 7.83/1.51 % (26281)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-26274"
% 7.83/1.52 % (26281)Refutation found. Thanks to Tanya!
% 7.83/1.52 % SZS status Theorem for theBenchmark
% 7.83/1.52 % SZS output start Proof for theBenchmark
% See solution above
% 7.83/1.52 % (26281)------------------------------
% 7.83/1.52 % (26281)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 7.83/1.52 % (26281)Termination reason: Refutation
% 7.83/1.52
% 7.83/1.52 % (26281)Memory used [KB]: 31047
% 7.83/1.52 % (26281)Time elapsed: 1.140 s
% 7.83/1.52 % (26281)Instructions burned: 3864 (million)
% 7.83/1.52 % (26274)Success in time 1.132 s
%------------------------------------------------------------------------------