%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : LCL045-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n026.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 : Thu Sep 24 01:09:15 PM UTC 2026
% Result : Unsatisfiable 2.09s 1.06s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL045-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.40 % Computer : n026.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Mon Sep 21 00:04:22 UTC 2026
% 0.13/0.41 % CPUTime :
% 0.19/0.43 % Drodi V4.1.1
% 2.09/1.06 % Refutation found
% 2.09/1.06 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 2.09/1.06 % SZS output start CNFRefutation for theBenchmark
% 2.09/1.06 fof(f1,axiom,(
% 2.09/1.06 (![X,Y]: (( ~ is_a_theorem(implies(X,Y))| ~ is_a_theorem(X)| is_a_theorem(Y) ) ))),
% 2.09/1.06 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 2.09/1.06 fof(f2,axiom,(
% 2.09/1.06 (![X,Y]: (is_a_theorem(implies(X,implies(not(X),Y))) ))),
% 2.09/1.06 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 2.09/1.06 fof(f3,axiom,(
% 2.09/1.06 (![X,Y]: (is_a_theorem(implies(X,implies(Y,X))) ))),
% 2.09/1.06 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 2.09/1.06 fof(f4,axiom,(
% 2.09/1.06 (![X,Y,Z]: (is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))) ))),
% 2.09/1.06 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 2.09/1.06 fof(f5,axiom,(
% 2.09/1.06 (![Y,Z,X]: (is_a_theorem(implies(implies(Y,Z),implies(implies(X,Y),implies(X,Z)))) ))),
% 2.09/1.06 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 2.09/1.06 fof(f6,axiom,(
% 2.09/1.06 (![X,Y]: (is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))) ))),
% 2.09/1.06 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 2.09/1.06 fof(f7,negated_conjecture,(
% 2.09/1.06 ~ is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))) ),
% 2.09/1.06 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 2.09/1.06 fof(f8,plain,(
% 2.09/1.06 ![Y]: ((![X]: (~is_a_theorem(implies(X,Y))|~is_a_theorem(X)))|is_a_theorem(Y))),
% 2.09/1.06 inference(miniscoping,[status(thm)],[f1])).
% 2.09/1.06 fof(f9,plain,(
% 2.09/1.06 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(X0)|is_a_theorem(X1))),
% 2.09/1.06 inference(cnf_transformation,[status(thm)],[f8])).
% 2.09/1.06 fof(f10,plain,(
% 2.09/1.06 ![X0,X1]: (is_a_theorem(implies(X0,implies(not(X0),X1))))),
% 2.09/1.06 inference(cnf_transformation,[status(thm)],[f2])).
% 2.09/1.06 fof(f11,plain,(
% 2.09/1.06 ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,X0))))),
% 2.09/1.06 inference(cnf_transformation,[status(thm)],[f3])).
% 2.09/1.06 fof(f12,plain,(
% 2.09/1.06 ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))))),
% 2.09/1.06 inference(cnf_transformation,[status(thm)],[f4])).
% 2.09/1.06 fof(f13,plain,(
% 2.09/1.06 ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))))),
% 2.09/1.06 inference(cnf_transformation,[status(thm)],[f5])).
% 2.09/1.06 fof(f14,plain,(
% 2.09/1.06 ![X0,X1]: (is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X1),X1))))),
% 2.09/1.06 inference(cnf_transformation,[status(thm)],[f6])).
% 2.09/1.06 fof(f15,plain,(
% 2.09/1.06 ~is_a_theorem(implies(implies(a,b),implies(not(b),not(a))))),
% 2.09/1.06 inference(cnf_transformation,[status(thm)],[f7])).
% 2.09/1.06 fof(f27,plain,(
% 2.09/1.06 ![X0,X1,X2]: (~is_a_theorem(implies(X0,implies(X1,X2)))|is_a_theorem(implies(X1,implies(X0,X2))))),
% 2.09/1.06 inference(resolution,[status(thm)],[f12,f9])).
% 2.09/1.06 fof(f28,plain,(
% 2.09/1.06 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(implies(X2,X0),implies(X2,X1))))),
% 2.09/1.06 inference(resolution,[status(thm)],[f13,f9])).
% 2.09/1.06 fof(f41,plain,(
% 2.09/1.06 ![X0,X1,X2]: (~is_a_theorem(implies(X0,implies(X1,X2)))|~is_a_theorem(X1)|is_a_theorem(implies(X0,X2)))),
% 2.09/1.06 inference(resolution,[status(thm)],[f27,f9])).
% 2.09/1.06 fof(f42,plain,(
% 2.09/1.06 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(implies(X2,X0))|is_a_theorem(implies(X2,X1)))),
% 2.09/1.06 inference(resolution,[status(thm)],[f28,f9])).
% 2.09/1.06 fof(f50,plain,(
% 2.09/1.06 ![X0,X1]: (~is_a_theorem(implies(not(X0),X1))|is_a_theorem(implies(implies(X0,X1),X1)))),
% 2.09/1.06 inference(resolution,[status(thm)],[f41,f14])).
% 2.09/1.06 fof(f67,plain,(
% 2.09/1.06 ![X0]: (~is_a_theorem(implies(X0,implies(not(b),not(a))))|~is_a_theorem(implies(implies(a,b),X0)))),
% 2.09/1.06 inference(resolution,[status(thm)],[f42,f15])).
% 2.09/1.06 fof(f152,plain,(
% 2.09/1.06 ![X0]: (~is_a_theorem(implies(implies(a,X0),implies(not(b),not(a))))|~is_a_theorem(implies(b,X0)))),
% 2.09/1.06 inference(resolution,[status(thm)],[f67,f28])).
% 2.09/1.06 fof(f173,definition,(
% 2.09/1.06 sQ11_spl <=> (is_a_theorem(implies(b,implies(not(b),not(a)))))),
% 2.09/1.06 introduced(definition,[new_symbols(definition,[sQ11_spl])],[split_symbol_definition])).
% 2.09/1.06 fof(f175,plain,(
% 2.09/1.06 ~is_a_theorem(implies(b,implies(not(b),not(a))))|sQ11_spl),
% 2.09/1.06 inference(component_clause,[status(thm)],[f173])).
% 2.09/1.06 fof(f200,plain,(
% 2.09/1.06 $false|sQ11_spl),
% 2.09/1.06 inference(forward_subsumption_resolution,[status(thm)],[f175,f10])).
% 2.09/1.06 fof(f201,plain,(
% 2.09/1.06 sQ11_spl),
% 2.09/1.06 inference(contradiction_clause,[status(thm)],[f200])).
% 2.09/1.06 fof(f683,plain,(
% 2.09/1.06 ~is_a_theorem(implies(b,implies(not(b),not(a))))|~is_a_theorem(implies(not(a),implies(not(b),not(a))))),
% 2.09/1.07 inference(resolution,[status(thm)],[f152,f50])).
% 2.09/1.07 fof(f696,definition,(
% 2.09/1.07 sQ35_spl <=> (is_a_theorem(implies(not(a),implies(not(b),not(a)))))),
% 2.09/1.07 introduced(definition,[new_symbols(definition,[sQ35_spl])],[split_symbol_definition])).
% 2.09/1.07 fof(f698,plain,(
% 2.09/1.07 ~is_a_theorem(implies(not(a),implies(not(b),not(a))))|sQ35_spl),
% 2.09/1.07 inference(component_clause,[status(thm)],[f696])).
% 2.09/1.07 fof(f699,plain,(
% 2.09/1.07 ~sQ11_spl|~sQ35_spl),
% 2.09/1.07 inference(split_clause,[status(thm)],[f683,f173,f696])).
% 2.09/1.07 fof(f713,plain,(
% 2.09/1.07 $false|sQ35_spl),
% 2.09/1.07 inference(forward_subsumption_resolution,[status(thm)],[f698,f11])).
% 2.09/1.07 fof(f714,plain,(
% 2.09/1.07 sQ35_spl),
% 2.09/1.07 inference(contradiction_clause,[status(thm)],[f713])).
% 2.09/1.07 fof(f715,plain,(
% 2.09/1.07 $false),
% 2.09/1.07 inference(sat_refutation,[status(thm)],[f201,f699,f714])).
% 2.09/1.07 % SZS output end CNFRefutation for theBenchmark.p
% 2.09/1.09 % Elapsed time: 0.658238 seconds
% 2.09/1.09 % CPU time: 4.651792 seconds
% 2.09/1.09 % Total memory used: 98.494 MB
% 2.09/1.09 % Net memory used: 89.599 MB
%------------------------------------------------------------------------------