TSTP Solution File: LCL486+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL486+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 : n022.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:10 EDT 2024
% Result : Theorem 2.90s 0.83s
% Output : Refutation 2.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 50 ( 17 unt; 0 def)
% Number of atoms : 94 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 83 ( 39 ~; 28 |; 2 &)
% ( 6 <=>; 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 : 80 ( 74 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f17158,plain,
$false,
inference(resolution,[],[f17156,f84]) ).
fof(f84,plain,
r5,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
r5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r5) ).
fof(f17156,plain,
~ r5,
inference(resolution,[],[f16496,f291]) ).
fof(f291,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(implies(X0,X1),implies(X0,X2))))
| ~ r5 ),
inference(forward_demodulation,[],[f289,f111]) ).
fof(f111,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(resolution,[],[f97,f91]) ).
fof(f91,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] :
( ~ op_implies_or
| implies(X0,X1) = or(not(X0),X1) ),
inference(cnf_transformation,[],[f67]) ).
fof(f67,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(f289,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(implies(X0,X1),or(not(X0),X2))))
| ~ r5 ),
inference(superposition,[],[f108,f111]) ).
fof(f108,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2))))
| ~ r5 ),
inference(cnf_transformation,[],[f79]) ).
fof(f79,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(f16496,plain,
~ is_a_theorem(implies(implies(sK1,sK2),implies(implies(sK0,sK1),implies(sK0,sK2)))),
inference(resolution,[],[f2985,f85]) ).
fof(f85,plain,
r4,
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
r4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r4) ).
fof(f2985,plain,
( ~ r4
| ~ is_a_theorem(implies(implies(sK1,sK2),implies(implies(sK0,sK1),implies(sK0,sK2)))) ),
inference(resolution,[],[f1130,f273]) ).
fof(f273,plain,
! [X0] :
( ~ is_a_theorem(implies(X0,implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f272,f89]) ).
fof(f89,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_modus_ponens) ).
fof(f272,plain,
! [X0] :
( ~ modus_ponens
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2))))) ),
inference(resolution,[],[f271,f107]) ).
fof(f107,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[],[f78]) ).
fof(f78,plain,
( ! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) )
| ~ modus_ponens ),
inference(flattening,[],[f77]) ).
fof(f77,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(f271,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))),
inference(resolution,[],[f102,f83]) ).
fof(f83,plain,
~ implies_3,
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
~ implies_3,
inference(flattening,[],[f46]) ).
fof(f46,negated_conjecture,
~ implies_3,
inference(negated_conjecture,[],[f45]) ).
fof(f45,conjecture,
implies_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_3) ).
fof(f102,plain,
( implies_3
| ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))) ),
inference(cnf_transformation,[],[f82]) ).
fof(f82,plain,
( implies_3
| ~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f72,f81]) ).
fof(f81,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(f72,plain,
( implies_3
| ? [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))))
=> implies_3 ),
inference(unused_predicate_definition_removal,[],[f6]) ).
fof(f6,axiom,
( implies_3
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_3) ).
fof(f1130,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2))))
| ~ r4 ),
inference(forward_demodulation,[],[f1118,f111]) ).
fof(f1118,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,or(not(X0),X2))))
| ~ r4 ),
inference(superposition,[],[f309,f111]) ).
fof(f309,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X2,implies(X0,X1)),implies(X0,or(X2,X1))))
| ~ r4 ),
inference(forward_demodulation,[],[f305,f111]) ).
fof(f305,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X2,implies(X0,X1)),or(not(X0),or(X2,X1))))
| ~ r4 ),
inference(superposition,[],[f109,f111]) ).
fof(f109,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(cnf_transformation,[],[f80]) ).
fof(f80,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/sandbox/benchmark/theBenchmark.p',r4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13 % Problem : LCL486+1 : TPTP v8.1.2. Released v3.3.0.
% 0.14/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n022.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 13:14:57 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % (1146)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (1151)WARNING: value z3 for option sas not known
% 0.15/0.38 % (1152)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (1150)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 % (1153)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 % (1155)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 % (1154)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 % (1151)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 % (1148)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [2]
% 0.15/0.40 TRYING [3]
% 0.15/0.41 TRYING [4]
% 0.23/0.44 TRYING [4]
% 0.23/0.50 TRYING [5]
% 2.90/0.81 TRYING [5]
% 2.90/0.82 % (1154)First to succeed.
% 2.90/0.82 % (1154)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1146"
% 2.90/0.83 % (1154)Refutation found. Thanks to Tanya!
% 2.90/0.83 % SZS status Theorem for theBenchmark
% 2.90/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 2.90/0.83 % (1154)------------------------------
% 2.90/0.83 % (1154)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.90/0.83 % (1154)Termination reason: Refutation
% 2.90/0.83
% 2.90/0.83 % (1154)Memory used [KB]: 9547
% 2.90/0.83 % (1154)Time elapsed: 0.442 s
% 2.90/0.83 % (1154)Instructions burned: 1086 (million)
% 2.90/0.83 % (1146)Success in time 0.459 s
%------------------------------------------------------------------------------