%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LCL536+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n019.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 24.95s 3.89s
% Output : Proof 24.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 20 unt; 0 def)
% Number of atoms : 72 ( 5 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 61 ( 26 ~; 22 |; 8 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 15 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f74,axiom,
( op_strict_implies
=> ! [X,Y] : strict_implies(X,Y) = necessarily(implies(X,Y)) ),
file('/export/starexec/sandbox2/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(f84,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(f84_nnf,plain,
op_strict_implies,
inference(nnf_transformation,[status(thm)],[f84]) ).
cnf(c142,plain,
op_strict_implies,
inference(cnf_transformation,[status(esa)],[f84_nnf]) ).
cnf(p228,plain,
strict_implies(X0,X1) = necessarily(implies(X0,X1)),
inference(resolution,[status(thm)],[c132,c142]) ).
fof(f57,axiom,
( axiom_5
<=> ! [X] : is_a_theorem(implies(possibly(X),necessarily(possibly(X)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f57_nnf,plain,
( ( ? [X] : ~ is_a_theorem(implies(possibly(X),necessarily(possibly(X))))
| axiom_5 )
& ( ! [X] : is_a_theorem(implies(possibly(X),necessarily(possibly(X))))
| ~ axiom_5 ) ),
inference(nnf_transformation,[status(thm)],[f57]) ).
fof(f57_sk,plain,
! [X] :
( ( ~ is_a_theorem(implies(possibly(sk67),necessarily(possibly(sk67))))
| axiom_5 )
& ( is_a_theorem(implies(possibly(X),necessarily(possibly(X))))
| ~ axiom_5 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk67])],[f57_nnf]) ).
cnf(c100,plain,
( is_a_theorem(implies(possibly(X0),necessarily(possibly(X0))))
| ~ axiom_5 ),
inference(cnf_transformation,[status(esa)],[f57_sk]) ).
fof(f80,axiom,
axiom_5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',km5_axiom_5) ).
fof(f80_nnf,plain,
axiom_5,
inference(nnf_transformation,[status(thm)],[f80]) ).
cnf(c138,plain,
axiom_5,
inference(cnf_transformation,[status(esa)],[f80_nnf]) ).
cnf(p208,plain,
is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))),
inference(resolution,[status(thm)],[c100,c138]) ).
fof(f49,axiom,
( necessitation
<=> ! [X] :
( is_a_theorem(X)
=> is_a_theorem(necessarily(X)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',necessitation) ).
fof(f49_nnf,plain,
( ( ? [X] :
( ~ is_a_theorem(necessarily(X))
& is_a_theorem(X) )
| necessitation )
& ( ! [X] :
( is_a_theorem(necessarily(X))
| ~ is_a_theorem(X) )
| ~ necessitation ) ),
inference(nnf_transformation,[status(thm)],[f49]) ).
fof(f49_sk,plain,
! [X] :
( ( ( ~ is_a_theorem(necessarily(sk55))
& is_a_theorem(sk55) )
| necessitation )
& ( is_a_theorem(necessarily(X))
| ~ is_a_theorem(X)
| ~ necessitation ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk55])],[f49_nnf]) ).
cnf(c78,plain,
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0)
| ~ necessitation ),
inference(cnf_transformation,[status(esa)],[f49_sk]) ).
fof(f77,axiom,
necessitation,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',km5_necessitation) ).
fof(f77_nnf,plain,
necessitation,
inference(nnf_transformation,[status(thm)],[f77]) ).
cnf(c135,plain,
necessitation,
inference(cnf_transformation,[status(esa)],[f77_nnf]) ).
cnf(p160,plain,
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c78,c135]) ).
cnf(p209,plain,
is_a_theorem(necessarily(implies(possibly(X0),necessarily(possibly(X0))))),
inference(resolution,[status(thm)],[p208,p160]) ).
cnf(p247,plain,
is_a_theorem(strict_implies(possibly(X0),necessarily(possibly(X0)))),
inference(superposition,[status(thm)],[p228,p209]) ).
fof(f71,axiom,
( axiom_m10
<=> ! [X] : is_a_theorem(strict_implies(possibly(X),necessarily(possibly(X)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_m10) ).
fof(f71_nnf,plain,
( ( ? [X] : ~ is_a_theorem(strict_implies(possibly(X),necessarily(possibly(X))))
| axiom_m10 )
& ( ! [X] : is_a_theorem(strict_implies(possibly(X),necessarily(possibly(X))))
| ~ axiom_m10 ) ),
inference(nnf_transformation,[status(thm)],[f71]) ).
fof(f71_sk,plain,
! [X] :
( ( ~ is_a_theorem(strict_implies(possibly(sk93),necessarily(possibly(sk93))))
| axiom_m10 )
& ( is_a_theorem(strict_implies(possibly(X),necessarily(possibly(X))))
| ~ axiom_m10 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk93])],[f71_nnf]) ).
cnf(c129,plain,
( ~ is_a_theorem(strict_implies(possibly(sk93),necessarily(possibly(sk93))))
| axiom_m10 ),
inference(cnf_transformation,[status(esa)],[f71_sk]) ).
cnf(p265,plain,
axiom_m10,
inference(resolution,[status(thm)],[p247,c129]) ).
fof(f87,conjecture,
axiom_m10,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_m10_axiom_m10) ).
fof(f87_neg,negated_conjecture,
~ axiom_m10,
inference(negated_conjecture,[status(cth)],[f87]) ).
fof(f87_nnf,plain,
~ axiom_m10,
inference(nnf_transformation,[status(thm)],[f87_neg]) ).
fof(f87_sk,plain,
~ axiom_m10,
inference(skolemisation,[status(esa)],[f87_nnf]) ).
cnf(c145,plain,
~ axiom_m10,
inference(cnf_transformation,[status(esa)],[f87_sk]) ).
cnf(p267,plain,
$false,
inference(resolution,[status(thm)],[p265,c145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL536+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/0.37 % Computer : n019.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 23:41:19 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 24.95/3.89 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 24.95/3.89 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------