TSTP Solution File: LCL538+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : LCL538+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n027.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 : Wed Aug 31 17:48:40 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 46 ( 19 unt; 0 def)
% Number of atoms : 102 ( 5 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 84 ( 28 ~; 24 |; 16 &)
% ( 5 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 36 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f278,plain,
$false,
inference(subsumption_resolution,[],[f277,f244]) ).
fof(f244,plain,
~ is_a_theorem(sK0),
inference(subsumption_resolution,[],[f234,f207]) ).
fof(f207,plain,
~ modus_ponens_strict_implies,
inference(cnf_transformation,[],[f108]) ).
fof(f108,plain,
~ modus_ponens_strict_implies,
inference(flattening,[],[f90]) ).
fof(f90,negated_conjecture,
~ modus_ponens_strict_implies,
inference(negated_conjecture,[],[f89]) ).
fof(f89,conjecture,
modus_ponens_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_modus_ponens_strict_implies) ).
fof(f234,plain,
( ~ is_a_theorem(sK0)
| modus_ponens_strict_implies ),
inference(cnf_transformation,[],[f184]) ).
fof(f184,plain,
( modus_ponens_strict_implies
| ( is_a_theorem(sK1)
& is_a_theorem(strict_implies(sK1,sK0))
& ~ is_a_theorem(sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f156,f183]) ).
fof(f183,plain,
( ? [X0,X1] :
( is_a_theorem(X1)
& is_a_theorem(strict_implies(X1,X0))
& ~ is_a_theorem(X0) )
=> ( is_a_theorem(sK1)
& is_a_theorem(strict_implies(sK1,sK0))
& ~ is_a_theorem(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f156,plain,
( modus_ponens_strict_implies
| ? [X0,X1] :
( is_a_theorem(X1)
& is_a_theorem(strict_implies(X1,X0))
& ~ is_a_theorem(X0) ) ),
inference(flattening,[],[f155]) ).
fof(f155,plain,
( modus_ponens_strict_implies
| ? [X0,X1] :
( ~ is_a_theorem(X0)
& is_a_theorem(strict_implies(X1,X0))
& is_a_theorem(X1) ) ),
inference(ennf_transformation,[],[f122]) ).
fof(f122,plain,
( ! [X0,X1] :
( ( is_a_theorem(strict_implies(X1,X0))
& is_a_theorem(X1) )
=> is_a_theorem(X0) )
=> modus_ponens_strict_implies ),
inference(unused_predicate_definition_removal,[],[f100]) ).
fof(f100,plain,
( modus_ponens_strict_implies
<=> ! [X0,X1] :
( ( is_a_theorem(strict_implies(X1,X0))
& is_a_theorem(X1) )
=> is_a_theorem(X0) ) ),
inference(rectify,[],[f51]) ).
fof(f51,axiom,
( modus_ponens_strict_implies
<=> ! [X1,X0] :
( ( is_a_theorem(X0)
& is_a_theorem(strict_implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens_strict_implies) ).
fof(f277,plain,
is_a_theorem(sK0),
inference(subsumption_resolution,[],[f276,f245]) ).
fof(f245,plain,
is_a_theorem(sK1),
inference(subsumption_resolution,[],[f236,f207]) ).
fof(f236,plain,
( is_a_theorem(sK1)
| modus_ponens_strict_implies ),
inference(cnf_transformation,[],[f184]) ).
fof(f276,plain,
( ~ is_a_theorem(sK1)
| is_a_theorem(sK0) ),
inference(resolution,[],[f275,f263]) ).
fof(f263,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(subsumption_resolution,[],[f219,f217]) ).
fof(f217,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_modus_ponens) ).
fof(f219,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X1)
| ~ modus_ponens
| is_a_theorem(X0) ),
inference(cnf_transformation,[],[f171]) ).
fof(f171,plain,
( ~ modus_ponens
| ! [X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(X0)
| ~ is_a_theorem(implies(X1,X0)) ) ),
inference(flattening,[],[f170]) ).
fof(f170,plain,
( ! [X1,X0] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X0)) )
| ~ modus_ponens ),
inference(ennf_transformation,[],[f138]) ).
fof(f138,plain,
( modus_ponens
=> ! [X1,X0] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X0)) )
=> is_a_theorem(X0) ) ),
inference(unused_predicate_definition_removal,[],[f97]) ).
fof(f97,plain,
( modus_ponens
<=> ! [X1,X0] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X0)) )
=> is_a_theorem(X0) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
( modus_ponens
<=> ! [X1,X0] :
( ( is_a_theorem(X0)
& is_a_theorem(implies(X0,X1)) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
fof(f275,plain,
is_a_theorem(implies(sK1,sK0)),
inference(resolution,[],[f272,f260]) ).
fof(f260,plain,
is_a_theorem(necessarily(implies(sK1,sK0))),
inference(backward_demodulation,[],[f246,f259]) ).
fof(f259,plain,
! [X0,X1] : strict_implies(X1,X0) = necessarily(implies(X1,X0)),
inference(subsumption_resolution,[],[f190,f194]) ).
fof(f194,plain,
op_strict_implies,
inference(cnf_transformation,[],[f86]) ).
fof(f86,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f190,plain,
! [X0,X1] :
( ~ op_strict_implies
| strict_implies(X1,X0) = necessarily(implies(X1,X0)) ),
inference(cnf_transformation,[],[f173]) ).
fof(f173,plain,
( ~ op_strict_implies
| ! [X0,X1] : strict_implies(X1,X0) = necessarily(implies(X1,X0)) ),
inference(rectify,[],[f143]) ).
fof(f143,plain,
( ~ op_strict_implies
| ! [X1,X0] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
inference(ennf_transformation,[],[f75]) ).
fof(f75,axiom,
( op_strict_implies
=> ! [X1,X0] : strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f246,plain,
is_a_theorem(strict_implies(sK1,sK0)),
inference(subsumption_resolution,[],[f235,f207]) ).
fof(f235,plain,
( is_a_theorem(strict_implies(sK1,sK0))
| modus_ponens_strict_implies ),
inference(cnf_transformation,[],[f184]) ).
fof(f272,plain,
! [X15] :
( ~ is_a_theorem(necessarily(X15))
| is_a_theorem(X15) ),
inference(resolution,[],[f263,f248]) ).
fof(f248,plain,
! [X0] : is_a_theorem(implies(necessarily(X0),X0)),
inference(subsumption_resolution,[],[f221,f218]) ).
fof(f218,plain,
axiom_M,
inference(cnf_transformation,[],[f80]) ).
fof(f80,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km4b_axiom_M) ).
fof(f221,plain,
! [X0] :
( is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(cnf_transformation,[],[f151]) ).
fof(f151,plain,
( ! [X0] : is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(ennf_transformation,[],[f120]) ).
fof(f120,plain,
( axiom_M
=> ! [X0] : is_a_theorem(implies(necessarily(X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f55]) ).
fof(f55,axiom,
( ! [X0] : is_a_theorem(implies(necessarily(X0),X0))
<=> axiom_M ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_M) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL538+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.34 % Computer : n027.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 : Tue Aug 30 02:22:30 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.51 % (19977)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (19995)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.51 % (19983)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (19987)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.52 % (19995)First to succeed.
% 0.20/0.52 % (19979)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (19984)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.52 % (19978)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.52 % (19973)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.52 % (19995)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (19995)------------------------------
% 0.20/0.52 % (19995)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (19995)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (19995)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (19995)Memory used [KB]: 1151
% 0.20/0.52 % (19995)Time elapsed: 0.074 s
% 0.20/0.52 % (19995)Instructions burned: 4 (million)
% 0.20/0.52 % (19995)------------------------------
% 0.20/0.52 % (19995)------------------------------
% 0.20/0.52 % (19972)Success in time 0.176 s
%------------------------------------------------------------------------------