%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL538+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:02:15 PM UTC 2026
% Result : Theorem 27.58s 4.06s
% Output : Proof 27.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 19 unt; 0 def)
% Number of atoms : 107 ( 5 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 99 ( 36 ~; 41 |; 16 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 21 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f34,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_modus_ponens) ).
fof(f34_nnf,plain,
modus_ponens,
inference(nnf_transformation,[status(thm)],[f34]) ).
cnf(c63,plain,
modus_ponens,
inference(cnf_transformation,[status(esa)],[f34_nnf]) ).
fof(f0,axiom,
( modus_ponens
<=> ! [X,Y] :
( ( is_a_theorem(implies(X,Y))
& is_a_theorem(X) )
=> is_a_theorem(Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens) ).
fof(f0_nnf,plain,
( ( ? [X,Y] :
( ~ is_a_theorem(Y)
& is_a_theorem(implies(X,Y))
& is_a_theorem(X) )
| modus_ponens )
& ( ! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) )
| ~ modus_ponens ) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Y] :
( ( ( ~ is_a_theorem(sk1)
& is_a_theorem(implies(sk0,sk1))
& is_a_theorem(sk0) )
| modus_ponens )
& ( is_a_theorem(Y)
| ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| ~ modus_ponens ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c0,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p147,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c63,c0]) ).
fof(f50,axiom,
( modus_ponens_strict_implies
<=> ! [X,Y] :
( ( is_a_theorem(strict_implies(X,Y))
& is_a_theorem(X) )
=> is_a_theorem(Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens_strict_implies) ).
fof(f50_nnf,plain,
( ( ? [X,Y] :
( ~ is_a_theorem(Y)
& is_a_theorem(strict_implies(X,Y))
& is_a_theorem(X) )
| modus_ponens_strict_implies )
& ( ! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(strict_implies(X,Y))
| ~ is_a_theorem(X) )
| ~ modus_ponens_strict_implies ) ),
inference(nnf_transformation,[status(thm)],[f50]) ).
fof(f50_sk,plain,
! [X,Y] :
( ( ( ~ is_a_theorem(sk57)
& is_a_theorem(strict_implies(sk56,sk57))
& is_a_theorem(sk56) )
| modus_ponens_strict_implies )
& ( is_a_theorem(Y)
| ~ is_a_theorem(strict_implies(X,Y))
| ~ is_a_theorem(X)
| ~ modus_ponens_strict_implies ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk56,sk57])],[f50_nnf]) ).
cnf(c83,plain,
( is_a_theorem(strict_implies(sk56,sk57))
| modus_ponens_strict_implies ),
inference(cnf_transformation,[status(esa)],[f50_sk]) ).
cnf(p320,plain,
( modus_ponens_strict_implies
| is_a_theorem(X0)
| ~ is_a_theorem(implies(strict_implies(sk56,sk57),X0)) ),
inference(resolution,[status(thm)],[p147,c83]) ).
fof(f74,axiom,
( op_strict_implies
=> ! [X,Y] : strict_implies(X,Y) = necessarily(implies(X,Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',op_strict_implies) ).
fof(f74_nnf,plain,
( ! [X,Y] : strict_implies(X,Y) = necessarily(implies(X,Y))
| ~ op_strict_implies ),
inference(nnf_transformation,[status(thm)],[f74]) ).
fof(f74_sk,plain,
! [X,Y] :
( strict_implies(X,Y) = necessarily(implies(X,Y))
| ~ op_strict_implies ),
inference(skolemisation,[status(esa)],[f74_nnf]) ).
cnf(c132,plain,
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[status(esa)],[f74_sk]) ).
fof(f85,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f85_nnf,plain,
op_strict_implies,
inference(nnf_transformation,[status(thm)],[f85]) ).
cnf(c143,plain,
op_strict_implies,
inference(cnf_transformation,[status(esa)],[f85_nnf]) ).
cnf(p238,plain,
strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(resolution,[status(thm)],[c132,c143]) ).
fof(f54,axiom,
( axiom_M
<=> ! [X] : is_a_theorem(implies(necessarily(X),X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_M) ).
fof(f54_nnf,plain,
( ( ? [X] : ~ is_a_theorem(implies(necessarily(X),X))
| axiom_M )
& ( ! [X] : is_a_theorem(implies(necessarily(X),X))
| ~ axiom_M ) ),
inference(nnf_transformation,[status(thm)],[f54]) ).
fof(f54_sk,plain,
! [X] :
( ( ~ is_a_theorem(implies(necessarily(sk64),sk64))
| axiom_M )
& ( is_a_theorem(implies(necessarily(X),X))
| ~ axiom_M ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk64])],[f54_nnf]) ).
cnf(c94,plain,
( is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(cnf_transformation,[status(esa)],[f54_sk]) ).
fof(f79,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',km4b_axiom_M) ).
fof(f79_nnf,plain,
axiom_M,
inference(nnf_transformation,[status(thm)],[f79]) ).
cnf(c137,plain,
axiom_M,
inference(cnf_transformation,[status(esa)],[f79_nnf]) ).
cnf(p151,plain,
is_a_theorem(implies(necessarily(X0),X0)),
inference(resolution,[status(thm)],[c94,c137]) ).
cnf(p239,plain,
is_a_theorem(implies(strict_implies(X0,X1),implies(X0,X1))),
inference(superposition,[status(thm)],[p238,p151]) ).
cnf(p1333,plain,
( modus_ponens_strict_implies
| is_a_theorem(implies(sk56,sk57)) ),
inference(resolution,[status(thm)],[p320,p239]) ).
cnf(c82,plain,
( is_a_theorem(sk56)
| modus_ponens_strict_implies ),
inference(cnf_transformation,[status(esa)],[f50_sk]) ).
cnf(p317,plain,
( modus_ponens_strict_implies
| is_a_theorem(X0)
| ~ is_a_theorem(implies(sk56,X0)) ),
inference(resolution,[status(thm)],[p147,c82]) ).
cnf(p1341,plain,
( modus_ponens_strict_implies
| is_a_theorem(sk57)
| modus_ponens_strict_implies ),
inference(resolution,[status(thm)],[p1333,p317]) ).
cnf(p1343,plain,
( is_a_theorem(sk57)
| modus_ponens_strict_implies ),
inference(factoring,[status(thm)],[p1341]) ).
cnf(c84,plain,
( ~ is_a_theorem(sk57)
| modus_ponens_strict_implies ),
inference(cnf_transformation,[status(esa)],[f50_sk]) ).
cnf(p1344,plain,
( modus_ponens_strict_implies
| modus_ponens_strict_implies ),
inference(resolution,[status(thm)],[p1343,c84]) ).
cnf(p1348,plain,
modus_ponens_strict_implies,
inference(factoring,[status(thm)],[p1344]) ).
fof(f88,conjecture,
modus_ponens_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_modus_ponens_strict_implies) ).
fof(f88_neg,negated_conjecture,
~ modus_ponens_strict_implies,
inference(negated_conjecture,[status(cth)],[f88]) ).
fof(f88_nnf,plain,
~ modus_ponens_strict_implies,
inference(nnf_transformation,[status(thm)],[f88_neg]) ).
fof(f88_sk,plain,
~ modus_ponens_strict_implies,
inference(skolemisation,[status(esa)],[f88_nnf]) ).
cnf(c146,plain,
~ modus_ponens_strict_implies,
inference(cnf_transformation,[status(esa)],[f88_sk]) ).
cnf(p1356,plain,
$false,
inference(resolution,[status(thm)],[p1348,c146]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL538+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.35 % Computer : n010.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Wed Sep 23 23:41:27 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 27.58/4.06 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.58/4.06 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------