%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : LCL546+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n015.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 : Mon Sep 7 01:04:01 PM UTC 2026
% Result : Theorem 19.12s 2.99s
% Output : Proof 19.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ axiom_m6,
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_m6s3m9b_axiom_m6)]) ).
cnf(g1,plain,
( ~ is_a_theorem(strict_implies(sK87,possibly(sK87)))
| axiom_m6 ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',axiom_m6)]) ).
cnf(g2,plain,
modus_ponens,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_modus_ponens)]) ).
cnf(g3,plain,
axiom_M,
inference(ground_cnf,[],[file('Axioms/LCL007+3.ax',km4b_axiom_M)]) ).
cnf(g4,plain,
( ~ sPE(necessarily(implies(sK87,possibly(sK87))),strict_implies(sK87,possibly(sK87)))
| ~ is_a_theorem(necessarily(implies(sK87,possibly(sK87))))
| is_a_theorem(strict_implies(sK87,possibly(sK87))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ sPE(strict_implies(sK87,possibly(sK87)),necessarily(implies(sK87,possibly(sK87))))
| sPE(necessarily(implies(sK87,possibly(sK87))),strict_implies(sK87,possibly(sK87))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ op_strict_implies
| sPE(strict_implies(sK87,possibly(sK87)),necessarily(implies(sK87,possibly(sK87)))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+1.ax',op_strict_implies)]) ).
cnf(g7,plain,
necessitation,
inference(ground_cnf,[],[file('Axioms/LCL007+3.ax',km4b_necessitation)]) ).
cnf(g8,plain,
axiom_B,
inference(ground_cnf,[],[file('Axioms/LCL007+3.ax',km4b_axiom_B)]) ).
cnf(g9,plain,
implies_3,
inference(ground_cnf,[],[file('Axioms/LCL006+2.ax',hilbert_implies_3)]) ).
cnf(g10,plain,
op_strict_implies,
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies)]) ).
cnf(g11,plain,
( ~ is_a_theorem(implies(sK87,possibly(sK87)))
| ~ necessitation
| is_a_theorem(necessarily(implies(sK87,possibly(sK87)))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',necessitation)]) ).
cnf(g12,plain,
( ~ axiom_M
| is_a_theorem(implies(necessarily(possibly(sK87)),possibly(sK87))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',axiom_M)]) ).
cnf(g13,plain,
( ~ axiom_B
| is_a_theorem(implies(sK87,necessarily(possibly(sK87)))) ),
inference(ground_cnf,[],[file('Axioms/LCL007+0.ax',axiom_B)]) ).
cnf(g14,plain,
( ~ modus_ponens
| ~ is_a_theorem(implies(necessarily(possibly(sK87)),possibly(sK87)))
| ~ is_a_theorem(implies(implies(necessarily(possibly(sK87)),possibly(sK87)),implies(sK87,possibly(sK87))))
| is_a_theorem(implies(sK87,possibly(sK87))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g15,plain,
( ~ modus_ponens
| ~ is_a_theorem(implies(sK87,necessarily(possibly(sK87))))
| ~ is_a_theorem(implies(implies(sK87,necessarily(possibly(sK87))),implies(implies(necessarily(possibly(sK87)),possibly(sK87)),implies(sK87,possibly(sK87)))))
| is_a_theorem(implies(implies(necessarily(possibly(sK87)),possibly(sK87)),implies(sK87,possibly(sK87)))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',modus_ponens)]) ).
cnf(g16,plain,
( ~ implies_3
| is_a_theorem(implies(implies(sK87,necessarily(possibly(sK87))),implies(implies(necessarily(possibly(sK87)),possibly(sK87)),implies(sK87,possibly(sK87))))) ),
inference(ground_cnf,[],[file('Axioms/LCL006+0.ax',implies_3)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL546+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : satcop --statistics %s
% 0.09/0.36 % Computer : n015.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 5 08:31:57 UTC 2026
% 0.09/0.36 % CPUTime :
% 19.12/2.99 % symbols: 165
% 19.12/2.99 % clauses: 160
% 19.12/2.99 % start clauses: 1
% 19.12/2.99 % iterative deepening steps: 7165
% 19.12/2.99 % maximum path limit: 6
% 19.12/2.99 % literal attempts: 2538773
% 19.12/2.99 % depth failures: 1631581
% 19.12/2.99 % regularity failures: 104899
% 19.12/2.99 % tautology failures: 89715
% 19.12/2.99 % reductions: 6535
% 19.12/2.99 % extensions: 2525300
% 19.12/2.99 % SAT variables: 853787
% 19.12/2.99 % SAT clauses: 978755
% 19.12/2.99 % WalkSAT solutions: 978751
% 19.12/2.99 % CDCL solutions: 0
% 19.12/2.99 % SZS status Theorem for theBenchmark
% 19.12/2.99 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------