TSTP Solution File: LCL496+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL496+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% Computer : n023.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 : Thu Aug 31 08:24:16 EDT 2023
% Result : Theorem 0.21s 0.44s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 51 ( 24 unt; 0 def)
% Number of atoms : 89 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 67 ( 29 ~; 21 |; 2 &)
% ( 7 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 90 (; 84 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f705,plain,
$false,
inference(subsumption_resolution,[],[f701,f193]) ).
fof(f193,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(implies(X0,X1),implies(X0,X2)))),
inference(forward_demodulation,[],[f190,f112]) ).
fof(f112,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(subsumption_resolution,[],[f97,f92]) ).
fof(f92,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox2/tmp/tmp.xpWjGbCkXd/Vampire---4.8_1986',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/sandbox2/tmp/tmp.xpWjGbCkXd/Vampire---4.8_1986',op_implies_or) ).
fof(f190,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(implies(X0,X1),or(not(X0),X2)))),
inference(superposition,[],[f188,f112]) ).
fof(f188,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))),
inference(subsumption_resolution,[],[f107,f85]) ).
fof(f85,plain,
r5,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
r5,
file('/export/starexec/sandbox2/tmp/tmp.xpWjGbCkXd/Vampire---4.8_1986',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/sandbox2/tmp/tmp.xpWjGbCkXd/Vampire---4.8_1986',r5) ).
fof(f701,plain,
~ is_a_theorem(implies(implies(sK1,sK2),implies(implies(sK0,sK1),implies(sK0,sK2)))),
inference(resolution,[],[f180,f216]) ).
fof(f216,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
inference(forward_demodulation,[],[f212,f112]) ).
fof(f212,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,or(not(X0),X2)))),
inference(superposition,[],[f200,f112]) ).
fof(f200,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X2,implies(X0,X1)),implies(X0,or(X2,X1)))),
inference(forward_demodulation,[],[f196,f112]) ).
fof(f196,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X2,implies(X0,X1)),or(not(X0),or(X2,X1)))),
inference(superposition,[],[f195,f112]) ).
fof(f195,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(subsumption_resolution,[],[f108,f86]) ).
fof(f86,plain,
r4,
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
r4,
file('/export/starexec/sandbox2/tmp/tmp.xpWjGbCkXd/Vampire---4.8_1986',principia_r4) ).
fof(f108,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(cnf_transformation,[],[f81]) ).
fof(f81,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(ennf_transformation,[],[f60]) ).
fof(f60,plain,
( r4
=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f58]) ).
fof(f58,plain,
( r4
<=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
inference(rectify,[],[f25]) ).
fof(f25,axiom,
( r4
<=> ! [X3,X4,X5] : is_a_theorem(implies(or(X3,or(X4,X5)),or(X4,or(X3,X5)))) ),
file('/export/starexec/sandbox2/tmp/tmp.xpWjGbCkXd/Vampire---4.8_1986',r4) ).
fof(f180,plain,
! [X0] :
( ~ is_a_theorem(implies(X0,implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f168,f118]) ).
fof(f118,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ),
inference(subsumption_resolution,[],[f106,f90]) ).
fof(f90,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/tmp/tmp.xpWjGbCkXd/Vampire---4.8_1986',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/sandbox2/tmp/tmp.xpWjGbCkXd/Vampire---4.8_1986',modus_ponens) ).
fof(f168,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))),
inference(subsumption_resolution,[],[f101,f84]) ).
fof(f84,plain,
~ cn1,
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
~ cn1,
inference(flattening,[],[f46]) ).
fof(f46,negated_conjecture,
~ cn1,
inference(negated_conjecture,[],[f45]) ).
fof(f45,conjecture,
cn1,
file('/export/starexec/sandbox2/tmp/tmp.xpWjGbCkXd/Vampire---4.8_1986',luka_cn1) ).
fof(f101,plain,
( cn1
| ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))) ),
inference(cnf_transformation,[],[f83]) ).
fof(f83,plain,
( cn1
| ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f73,f82]) ).
fof(f82,plain,
( ? [X0,X1,X2] : ~ is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
=> ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))) ),
introduced(choice_axiom,[]) ).
fof(f73,plain,
( cn1
| ? [X0,X1,X2] : ~ is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(ennf_transformation,[],[f64]) ).
fof(f64,plain,
( ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
=> cn1 ),
inference(unused_predicate_definition_removal,[],[f53]) ).
fof(f53,plain,
( cn1
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(rectify,[],[f19]) ).
fof(f19,axiom,
( cn1
<=> ! [X3,X4,X5] : is_a_theorem(implies(implies(X3,X4),implies(implies(X4,X5),implies(X3,X5)))) ),
file('/export/starexec/sandbox2/tmp/tmp.xpWjGbCkXd/Vampire---4.8_1986',cn1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL496+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 24 17:59:57 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 Running vampire_casc2023 --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/tmp/tmp.xpWjGbCkXd/Vampire---4.8_1986
% 0.13/0.36 % (2099)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (2103)lrs-3_8_anc=none:bce=on:cond=on:drc=off:flr=on:fsd=off:fsr=off:fde=unused:gsp=on:gs=on:gsaa=full_model:lcm=predicate:lma=on:nm=16:sos=all:sp=weighted_frequency:tgt=ground:urr=ec_only:stl=188_482 on Vampire---4 for (482ds/0Mi)
% 0.21/0.42 % (2102)dis-11_4:1_aac=none:add=off:afr=on:anc=none:bd=preordered:bs=on:bsr=on:drc=off:fsr=off:fde=none:gsp=on:irw=on:lcm=reverse:lma=on:nm=0:nwc=1.7:nicw=on:sas=z3:sims=off:sos=all:sac=on:sp=weighted_frequency:tgt=full_602 on Vampire---4 for (602ds/0Mi)
% 0.21/0.42 % (2105)dis+1011_4_add=large:amm=off:sims=off:sac=on:sp=frequency:tgt=ground_413 on Vampire---4 for (413ds/0Mi)
% 0.21/0.42 % (2100)lrs+10_11_cond=on:drc=off:flr=on:fsr=off:gsp=on:gs=on:gsem=off:lma=on:msp=off:nm=4:nwc=1.5:nicw=on:sas=z3:sims=off:sp=scramble:stl=188_730 on Vampire---4 for (730ds/0Mi)
% 0.21/0.42 % (2101)dis+1010_4:1_anc=none:bd=off:drc=off:flr=on:fsr=off:nm=4:nwc=1.1:nicw=on:sas=z3_680 on Vampire---4 for (680ds/0Mi)
% 0.21/0.42 % (2104)lrs+1010_20_av=off:bd=off:bs=on:bsr=on:bce=on:flr=on:fde=none:gsp=on:nwc=3.0:tgt=ground:urr=ec_only:stl=125_424 on Vampire---4 for (424ds/0Mi)
% 0.21/0.42 % (2106)ott+11_14_av=off:bs=on:bsr=on:cond=on:flr=on:fsd=off:fde=unused:gsp=on:nm=4:nwc=1.5:tgt=full_386 on Vampire---4 for (386ds/0Mi)
% 0.21/0.42 % (2103)Refutation not found, incomplete strategy% (2103)------------------------------
% 0.21/0.42 % (2103)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.21/0.42 % (2103)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.21/0.42 % (2103)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.42
% 0.21/0.42 % (2103)Memory used [KB]: 9978
% 0.21/0.42 % (2103)Time elapsed: 0.004 s
% 0.21/0.42 % (2103)------------------------------
% 0.21/0.42 % (2103)------------------------------
% 0.21/0.44 % (2105)First to succeed.
% 0.21/0.44 % (2105)Refutation found. Thanks to Tanya!
% 0.21/0.44 % SZS status Theorem for Vampire---4
% 0.21/0.44 % SZS output start Proof for Vampire---4
% See solution above
% 0.21/0.44 % (2105)------------------------------
% 0.21/0.44 % (2105)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.21/0.44 % (2105)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.21/0.44 % (2105)Termination reason: Refutation
% 0.21/0.44
% 0.21/0.44 % (2105)Memory used [KB]: 6268
% 0.21/0.44 % (2105)Time elapsed: 0.021 s
% 0.21/0.44 % (2105)------------------------------
% 0.21/0.44 % (2105)------------------------------
% 0.21/0.44 % (2099)Success in time 0.08 s
% 0.21/0.44 % Vampire---4.8 exiting
%------------------------------------------------------------------------------