TSTP Solution File: LCL486+1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : LCL486+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n021.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 : Mon Jun 24 11:26:33 EDT 2024
% Result : Theorem 0.22s 0.47s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 50 ( 24 unt; 0 def)
% Number of atoms : 87 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 66 ( 29 ~; 21 |; 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 : 87 ( 81 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2378,plain,
$false,
inference(subsumption_resolution,[],[f2353,f188]) ).
fof(f188,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(implies(X0,X1),implies(X0,X2)))),
inference(forward_demodulation,[],[f186,f110]) ).
fof(f110,plain,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
inference(subsumption_resolution,[],[f97,f91]) ).
fof(f91,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f97,plain,
! [X0,X1] :
( implies(X0,X1) = or(not(X0),X1)
| ~ op_implies_or ),
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/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f186,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(implies(X0,X1),or(not(X0),X2)))),
inference(superposition,[],[f122,f110]) ).
fof(f122,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))),
inference(subsumption_resolution,[],[f108,f84]) ).
fof(f84,plain,
r5,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
r5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
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/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f2353,plain,
~ is_a_theorem(implies(implies(sK1,sK2),implies(implies(sK0,sK1),implies(sK0,sK2)))),
inference(resolution,[],[f557,f175]) ).
fof(f175,plain,
! [X0] :
( ~ is_a_theorem(implies(X0,implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f116,f121]) ).
fof(f121,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ),
inference(subsumption_resolution,[],[f107,f89]) ).
fof(f89,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
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/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f116,plain,
~ is_a_theorem(implies(implies(sK0,sK1),implies(implies(sK1,sK2),implies(sK0,sK2)))),
inference(subsumption_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/sandbox2/benchmark/theBenchmark.p',unknown) ).
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/sandbox2/benchmark/theBenchmark.p',unknown) ).
fof(f557,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
inference(forward_demodulation,[],[f545,f110]) ).
fof(f545,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,or(not(X0),X2)))),
inference(superposition,[],[f196,f110]) ).
fof(f196,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X2,implies(X0,X1)),implies(X0,or(X2,X1)))),
inference(forward_demodulation,[],[f192,f110]) ).
fof(f192,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X2,implies(X0,X1)),or(not(X0),or(X2,X1)))),
inference(superposition,[],[f123,f110]) ).
fof(f123,plain,
! [X2,X0,X1] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(subsumption_resolution,[],[f109,f85]) ).
fof(f85,plain,
r4,
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
r4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
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/sandbox2/benchmark/theBenchmark.p',unknown) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL486+1 : TPTP v8.2.0. Released v3.3.0.
% 0.03/0.13 % Command : run_vampire %s %d THM
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat Jun 22 12:10:24 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.21/0.36 Running first-order theorem proving
% 0.21/0.36 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.43 % (15071)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.43 % (15081)lrs+1010_1:1_to=lpo:sil=2000:plsq=on:plsqr=32,1:sp=reverse_arity:sos=on:spb=goal_then_units:i=128:ss=axioms:sgt=50:bd=off:sd=3_0 on theBenchmark for (2999ds/128Mi)
% 0.21/0.43 % (15071)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.43 % (15080)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=113:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2999ds/113Mi)
% 0.21/0.43 % (15071)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.43 % (15079)lrs+1011_1:1_sil=32000:rnwc=on:nwc=10.0:lwlo=on:i=121:bd=off:av=off_0 on theBenchmark for (2999ds/121Mi)
% 0.21/0.43 % (15071)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.43 % (15078)lrs+1011_1:1_sil=2000:i=103:ep=RS:nm=32:ss=axioms:sos=on_0 on theBenchmark for (2999ds/103Mi)
% 0.21/0.43 % (15071)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.43 % (15076)lrs+1002_74:59_drc=off:tgt=full:sos=all:cond=fast:i=124987:kws=inv_frequency:afp=300:afq=2.0744697298148953:rawr=on:urr=full:sil=128000:si=on:rtra=on:random_seed=3250543_0 on theBenchmark for (2999ds/124987Mi)
% 0.21/0.43 % (15071)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.43 % (15075)lrs+2_5:39_bsr=unit_only:to=lpo:drc=off:sil=128000:plsq=on:plsqr=2,19:sp=frequency:lcm=reverse:fd=preordered:s2a=on:i=38749:s2at=-1.0:fsr=off:uhcvi=on:rawr=on:aer=off:lwlo=on:add=off:bce=on:acc=model:afr=on_0 on theBenchmark for (2999ds/38749Mi)
% 0.21/0.43 % (15071)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.43 % (15077)lrs+11_1:16_to=lpo:drc=off:bsd=on:sp=frequency:i=172350:bs=on:av=off:fsd=on:sil=256000:fdi=50_0 on theBenchmark for (2999ds/172350Mi)
% 0.21/0.43 % (15078)Refutation not found, incomplete strategy% (15078)------------------------------
% 0.21/0.43 % (15078)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.43 % (15080)Refutation not found, incomplete strategy% (15080)------------------------------
% 0.21/0.43 % (15080)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.43 % (15078)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.43 % (15078)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.43 % (15080)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.43
% 0.21/0.43 % (15080)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.43 % (15078)Memory used [KB]: 1084
% 0.21/0.43
% 0.21/0.43 % (15078)Time elapsed: 0.002 s
% 0.21/0.43 % (15078)Instructions burned: 1 (million)
% 0.21/0.43 % (15080)Memory used [KB]: 1085
% 0.21/0.43 % (15080)Time elapsed: 0.002 s
% 0.21/0.43 % (15080)Instructions burned: 1 (million)
% 0.21/0.43 % (15080)------------------------------
% 0.21/0.43 % (15080)------------------------------
% 0.21/0.43 % (15078)------------------------------
% 0.21/0.43 % (15078)------------------------------
% 0.21/0.43 % (15081)Refutation not found, incomplete strategy% (15081)------------------------------
% 0.21/0.43 % (15081)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.21/0.43 % (15081)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.21/0.43 % (15081)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.43
% 0.21/0.43 % (15081)Memory used [KB]: 1162
% 0.21/0.43 % (15081)Time elapsed: 0.004 s
% 0.21/0.43 % (15081)Instructions burned: 4 (million)
% 0.21/0.43 % (15081)------------------------------
% 0.21/0.43 % (15081)------------------------------
% 0.22/0.47 % (15079)First to succeed.
% 0.22/0.47 % (15079)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-15071"
% 0.22/0.47 % (15071)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.47 % (15079)Refutation found. Thanks to Tanya!
% 0.22/0.47 % SZS status Theorem for theBenchmark
% 0.22/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.47 % (15079)------------------------------
% 0.22/0.47 % (15079)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.22/0.47 % (15079)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.22/0.47 % (15079)Termination reason: Refutation
% 0.22/0.47
% 0.22/0.47 % (15079)Memory used [KB]: 2097
% 0.22/0.47 % (15079)Time elapsed: 0.043 s
% 0.22/0.47 % (15079)Instructions burned: 69 (million)
% 0.22/0.47 % (15079)------------------------------
% 0.22/0.47 % (15079)------------------------------
% 0.22/0.47 % (15071)Success in time 0.103 s
%------------------------------------------------------------------------------