TSTP Solution File: LCL469+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL469+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 : n019.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 Apr 30 13:42:31 EDT 2024
% Result : Theorem 0.12s 0.37s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 17 unt; 0 def)
% Number of atoms : 51 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 32 ( 15 ~; 9 |; 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 : 40 ( 36 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f171,plain,
$false,
inference(resolution,[],[f148,f101]) ).
fof(f101,plain,
~ is_a_theorem(implies(sK0,or(sK0,sK1))),
inference(subsumption_resolution,[],[f92,f78]) ).
fof(f78,plain,
~ or_1,
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
~ or_1,
inference(flattening,[],[f44]) ).
fof(f44,negated_conjecture,
~ or_1,
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
or_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_or_1) ).
fof(f92,plain,
( or_1
| ~ is_a_theorem(implies(sK0,or(sK0,sK1))) ),
inference(cnf_transformation,[],[f77]) ).
fof(f77,plain,
( or_1
| ~ is_a_theorem(implies(sK0,or(sK0,sK1))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f69,f76]) ).
fof(f76,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(X0,or(X0,X1)))
=> ~ is_a_theorem(implies(sK0,or(sK0,sK1))) ),
introduced(choice_axiom,[]) ).
fof(f69,plain,
( or_1
| ? [X0,X1] : ~ is_a_theorem(implies(X0,or(X0,X1))) ),
inference(ennf_transformation,[],[f60]) ).
fof(f60,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1)))
=> or_1 ),
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(f148,plain,
! [X0,X1] : is_a_theorem(implies(X0,or(X0,X1))),
inference(superposition,[],[f103,f130]) ).
fof(f130,plain,
! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
inference(superposition,[],[f99,f98]) ).
fof(f98,plain,
! [X0,X1] : implies(X0,X1) = not(and(X0,not(X1))),
inference(subsumption_resolution,[],[f89,f84]) ).
fof(f84,plain,
op_implies_and,
inference(cnf_transformation,[],[f41]) ).
fof(f41,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(f89,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[],[f66]) ).
fof(f66,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(f99,plain,
! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))),
inference(subsumption_resolution,[],[f90,f86]) ).
fof(f86,plain,
op_or,
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_op_or) ).
fof(f90,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[],[f67]) ).
fof(f67,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(f103,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(subsumption_resolution,[],[f94,f80]) ).
fof(f80,plain,
cn2,
inference(cnf_transformation,[],[f37]) ).
fof(f37,axiom,
cn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).
fof(f94,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ cn2 ),
inference(cnf_transformation,[],[f71]) ).
fof(f71,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
| ~ cn2 ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,plain,
( cn2
=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f55,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.06/0.12 % Problem : LCL469+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 29 22:54:59 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % (20581)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.36 % (20584)WARNING: value z3 for option sas not known
% 0.12/0.36 % (20586)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.12/0.36 % (20585)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.12/0.36 % (20588)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.12/0.36 % (20583)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.12/0.36 % (20587)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.12/0.36 % (20584)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.12/0.37 TRYING [1]
% 0.12/0.37 % (20582)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.12/0.37 TRYING [2]
% 0.12/0.37 % (20588)First to succeed.
% 0.12/0.37 % (20587)Also succeeded, but the first one will report.
% 0.12/0.37 TRYING [1]
% 0.12/0.37 TRYING [2]
% 0.12/0.37 TRYING [3]
% 0.12/0.37 % (20584)Also succeeded, but the first one will report.
% 0.12/0.37 % (20588)Refutation found. Thanks to Tanya!
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.37 % (20588)------------------------------
% 0.12/0.37 % (20588)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.12/0.37 % (20588)Termination reason: Refutation
% 0.12/0.37
% 0.12/0.37 % (20588)Memory used [KB]: 906
% 0.12/0.37 % (20588)Time elapsed: 0.004 s
% 0.12/0.37 % (20588)Instructions burned: 6 (million)
% 0.12/0.37 % (20588)------------------------------
% 0.12/0.37 % (20588)------------------------------
% 0.12/0.37 % (20581)Success in time 0.021 s
%------------------------------------------------------------------------------