%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL341-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n004.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:06:22 PM UTC 2026
% Result : Unsatisfiable 19.49s 3.24s
% Output : CNFRefutation 19.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 24
% Syntax : Number of formulae : 114 ( 114 unt; 12 def)
% Number of atoms : 239 ( 113 equ)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 13 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-4 aty)
% Number of variables : 129 ( 0 sgn 129 !; 0 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f2,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f4,plain,
! [X0,X1] : true = axiom(implies(X0,or(X1,X0))),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f6,plain,
! [X0,X1] : true = axiom(implies(or(X0,X1),or(X1,X0))),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f8,plain,
! [X2,X0,X1] : true = axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(reorient_equations,[],[f7]) ).
fof(f9,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f10,plain,
! [X2,X0,X1] : true = axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(reorient_equations,[],[f9]) ).
fof(f11,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f12,axiom,
! [X0] : ifeq(axiom(X0),true,theorem(X0),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f13,plain,
! [X0] : true = ifeq(axiom(X0),true,theorem(X0),true),
inference(reorient_equations,[],[f12]) ).
fof(f14,axiom,
! [X0,X1] : ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f15,plain,
! [X0,X1] : true = ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true),
inference(reorient_equations,[],[f14]) ).
fof(f16,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).
fof(f17,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalent_defn) ).
fof(f18,negated_conjecture,
theorem(implies(p,equivalent(implies(p,q),q))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f19,plain,
true != theorem(implies(p,equivalent(implies(p,q),q))),
inference(reorient_equations,[],[f18]) ).
fof(f20,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f17,f16,f11,f11]) ).
fof(f21,plain,
! [X0] : true = axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f2,f11]) ).
fof(f22,plain,
! [X0,X1] : true = axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f4,f11]) ).
fof(f23,plain,
! [X0,X1] : true = axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f6,f11]) ).
fof(f24,plain,
! [X2,X0,X1] : true = axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f8,f11]) ).
fof(f25,plain,
! [X2,X0,X1] : true = axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f10,f11,f11,f11]) ).
fof(f26,plain,
! [X0,X1] : true = ifeq(theorem(or(not(X0),X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true),
inference(definition_unfolding,[],[f15,f11]) ).
fof(f27,plain,
true != theorem(or(not(p),not(or(not(or(not(or(not(p),q)),q)),not(or(not(q),or(not(p),q))))))),
inference(definition_unfolding,[],[f19,f11,f20,f11]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(X0,X0,X1,X2) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_62,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)) = true,
inference(cnf_transformation,[],[f21]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))) = true,
inference(cnf_transformation,[],[f22]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(cnf_transformation,[],[f23]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) = true,
inference(cnf_transformation,[],[f24]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) = true,
inference(cnf_transformation,[],[f25]) ).
tcf(c_67,plain,
! [X0: $i] : ifeq(axiom(X0),true,theorem(X0),true) = true,
inference(cnf_transformation,[],[f13]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] : ifeq(theorem(or(not(X0),X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
inference(cnf_transformation,[],[f26]) ).
tcf(c_69,negated_conjecture,
theorem(or(not(p),not(or(not(or(not(or(not(p),q)),q)),not(or(not(q),or(not(p),q))))))) != true,
inference(cnf_transformation,[],[f27]) ).
tcf(c_103,definition,
iPr_def_10 = not(p),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_104,definition,
iPr_def_11 = or(iPr_def_10,q),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_105,definition,
iPr_def_12 = not(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_106,definition,
iPr_def_13 = or(iPr_def_12,q),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_107,definition,
iPr_def_14 = not(iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_108,definition,
iPr_def_15 = not(q),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_109,definition,
iPr_def_16 = or(iPr_def_15,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_110,definition,
iPr_def_17 = not(iPr_def_16),
introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).
tcf(c_111,definition,
iPr_def_18 = or(iPr_def_14,iPr_def_17),
introduced(definition,[new_symbols(definition,[iPr_def_18])],[]) ).
tcf(c_112,definition,
iPr_def_19 = not(iPr_def_18),
introduced(definition,[new_symbols(definition,[iPr_def_19])],[]) ).
tcf(c_113,definition,
iPr_def_20 = or(iPr_def_10,iPr_def_19),
introduced(definition,[new_symbols(definition,[iPr_def_20])],[]) ).
tcf(c_114,definition,
iPr_def_21 = theorem(iPr_def_20),
introduced(definition,[new_symbols(definition,[iPr_def_21])],[]) ).
tcf(c_115,negated_conjecture,
iPr_def_21 != true,
inference(demodulation,[status(thm)],[c_69,c_108,c_109,c_110,c_104,c_105,c_106,c_107,c_111,c_112,c_103,c_113,c_114]) ).
tcf(c_116,plain,
! [X0: $i,X1: $i] : ifeq(theorem(or(not(X0),X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
inference(demodulation,[status(thm)],[c_68]) ).
tcf(c_117,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) = true,
inference(demodulation,[status(thm)],[c_66]) ).
tcf(c_118,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) = true,
inference(demodulation,[status(thm)],[c_65]) ).
tcf(c_119,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(demodulation,[status(thm)],[c_64]) ).
tcf(c_120,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))) = true,
inference(demodulation,[status(thm)],[c_63]) ).
tcf(c_121,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)) = true,
inference(demodulation,[status(thm)],[c_62]) ).
tcf(c_122,plain,
! [X0: $i] : ifeq(axiom(X0),true,theorem(X0),true) = true,
inference(demodulation,[status(thm)],[c_67]) ).
tcf(c_123,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(X0,X0,X1,X2) = X1,
inference(demodulation,[status(thm)],[c_61]) ).
tcf(c_221,plain,
axiom(or(not(q),iPr_def_11)) = true,
inference(superposition,[status(thm)],[c_104,c_120]) ).
tcf(c_228,plain,
axiom(iPr_def_16) = true,
inference(demodulation,[status(thm)],[c_221,c_108,c_109]) ).
tcf(c_235,plain,
! [X0: $i] : ifeq(true,true,theorem(or(not(or(X0,X0)),X0)),true) = true,
inference(superposition,[status(thm)],[c_121,c_122]) ).
tcf(c_236,plain,
! [X0: $i,X1: $i] : ifeq(true,true,theorem(or(not(X0),or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[c_120,c_122]) ).
tcf(c_238,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))) = true,
inference(demodulation,[status(thm)],[c_236,c_123]) ).
tcf(c_239,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)) = true,
inference(demodulation,[status(thm)],[c_235,c_123]) ).
tcf(c_245,plain,
axiom(or(not(iPr_def_18),or(iPr_def_17,iPr_def_14))) = true,
inference(superposition,[status(thm)],[c_111,c_119]) ).
tcf(c_252,plain,
! [X0: $i,X1: $i] : ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[c_119,c_122]) ).
tcf(c_253,plain,
axiom(or(iPr_def_19,or(iPr_def_17,iPr_def_14))) = true,
inference(demodulation,[status(thm)],[c_245,c_112]) ).
tcf(c_257,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(demodulation,[status(thm)],[c_252,c_123]) ).
tcf(c_278,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(iPr_def_14,X0)),or(not(or(X1,iPr_def_13)),or(X1,X0)))) = true,
inference(superposition,[status(thm)],[c_107,c_117]) ).
tcf(c_328,plain,
! [X0: $i] : axiom(or(not(or(X0,iPr_def_11)),or(iPr_def_10,or(X0,q)))) = true,
inference(superposition,[status(thm)],[c_104,c_118]) ).
tcf(c_338,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(true,true,theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),true) = true,
inference(superposition,[status(thm)],[c_118,c_122]) ).
tcf(c_339,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) = true,
inference(demodulation,[status(thm)],[c_338,c_123]) ).
tcf(c_354,plain,
ifeq(true,true,theorem(iPr_def_16),true) = true,
inference(superposition,[status(thm)],[c_228,c_122]) ).
tcf(c_355,plain,
theorem(iPr_def_16) = true,
inference(demodulation,[status(thm)],[c_354,c_123]) ).
tcf(c_356,plain,
! [X0: $i] : ifeq(theorem(or(not(iPr_def_16),X0)),true,ifeq(true,true,theorem(X0),true),true) = true,
inference(superposition,[status(thm)],[c_355,c_116]) ).
tcf(c_359,plain,
! [X0: $i] : ifeq(theorem(or(iPr_def_17,X0)),true,theorem(X0),true) = true,
inference(demodulation,[status(thm)],[c_356,c_123,c_110]) ).
tcf(c_437,plain,
ifeq(true,true,theorem(or(iPr_def_19,or(iPr_def_17,iPr_def_14))),true) = true,
inference(superposition,[status(thm)],[c_253,c_122]) ).
tcf(c_438,plain,
theorem(or(iPr_def_19,or(iPr_def_17,iPr_def_14))) = true,
inference(demodulation,[status(thm)],[c_437,c_123]) ).
tcf(c_452,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(theorem(or(not(or(not(X0),or(X1,X0))),X2)),true,ifeq(true,true,theorem(X2),true),true) = true,
inference(superposition,[status(thm)],[c_238,c_116]) ).
tcf(c_457,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(theorem(or(not(or(not(X0),or(X1,X0))),X2)),true,theorem(X2),true) = true,
inference(demodulation,[status(thm)],[c_452,c_123]) ).
tcf(c_464,plain,
! [X0: $i] : ifeq(true,true,ifeq(theorem(or(X0,X0)),true,theorem(X0),true),true) = true,
inference(superposition,[status(thm)],[c_239,c_116]) ).
tcf(c_465,plain,
! [X0: $i] : ifeq(theorem(or(X0,X0)),true,theorem(X0),true) = true,
inference(demodulation,[status(thm)],[c_464,c_123]) ).
tcf(c_525,plain,
! [X0: $i] : ifeq(theorem(or(not(or(iPr_def_19,or(iPr_def_17,iPr_def_14))),X0)),true,ifeq(true,true,theorem(X0),true),true) = true,
inference(superposition,[status(thm)],[c_438,c_116]) ).
tcf(c_528,plain,
! [X0: $i] : ifeq(theorem(or(not(or(iPr_def_19,or(iPr_def_17,iPr_def_14))),X0)),true,theorem(X0),true) = true,
inference(demodulation,[status(thm)],[c_525,c_123]) ).
tcf(c_571,plain,
! [X0: $i,X1: $i] : ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),true) = true,
inference(superposition,[status(thm)],[c_257,c_116]) ).
tcf(c_572,plain,
! [X0: $i,X1: $i] : ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true) = true,
inference(demodulation,[status(thm)],[c_571,c_123]) ).
tcf(c_1316,plain,
axiom(or(not(or(iPr_def_14,iPr_def_19)),or(not(or(iPr_def_10,iPr_def_13)),iPr_def_20))) = true,
inference(superposition,[status(thm)],[c_113,c_278]) ).
tcf(c_1981,plain,
axiom(or(not(or(iPr_def_12,iPr_def_11)),or(iPr_def_10,iPr_def_13))) = true,
inference(superposition,[status(thm)],[c_106,c_328]) ).
tcf(c_2462,plain,
ifeq(true,true,theorem(or(not(or(iPr_def_12,iPr_def_11)),or(iPr_def_10,iPr_def_13))),true) = true,
inference(superposition,[status(thm)],[c_1981,c_122]) ).
tcf(c_2463,plain,
theorem(or(not(or(iPr_def_12,iPr_def_11)),or(iPr_def_10,iPr_def_13))) = true,
inference(demodulation,[status(thm)],[c_2462,c_123]) ).
tcf(c_3066,plain,
! [X0: $i,X1: $i] : ifeq(true,true,theorem(or(X0,or(not(X1),X1))),true) = true,
inference(superposition,[status(thm)],[c_339,c_457]) ).
tcf(c_3144,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(X1),X1))) = true,
inference(demodulation,[status(thm)],[c_3066,c_123]) ).
tcf(c_3244,plain,
! [X0: $i] : theorem(or(X0,or(iPr_def_12,iPr_def_11))) = true,
inference(superposition,[status(thm)],[c_105,c_3144]) ).
tcf(c_3477,plain,
ifeq(true,true,theorem(or(iPr_def_12,iPr_def_11)),true) = true,
inference(superposition,[status(thm)],[c_3244,c_465]) ).
tcf(c_3478,plain,
theorem(or(iPr_def_12,iPr_def_11)) = true,
inference(demodulation,[status(thm)],[c_3477,c_123]) ).
tcf(c_4581,plain,
ifeq(true,true,ifeq(theorem(or(iPr_def_12,iPr_def_11)),true,theorem(or(iPr_def_10,iPr_def_13)),true),true) = true,
inference(superposition,[status(thm)],[c_2463,c_116]) ).
tcf(c_4584,plain,
theorem(or(iPr_def_10,iPr_def_13)) = true,
inference(demodulation,[status(thm)],[c_4581,c_123,c_3478]) ).
tcf(c_4704,plain,
ifeq(true,true,theorem(or(iPr_def_17,or(iPr_def_19,iPr_def_14))),true) = true,
inference(superposition,[status(thm)],[c_339,c_528]) ).
tcf(c_4792,plain,
theorem(or(iPr_def_17,or(iPr_def_19,iPr_def_14))) = true,
inference(demodulation,[status(thm)],[c_4704,c_123]) ).
tcf(c_4811,plain,
! [X0: $i] : ifeq(theorem(or(not(or(iPr_def_10,iPr_def_13)),X0)),true,ifeq(true,true,theorem(X0),true),true) = true,
inference(superposition,[status(thm)],[c_4584,c_116]) ).
tcf(c_4846,plain,
! [X0: $i] : ifeq(theorem(or(not(or(iPr_def_10,iPr_def_13)),X0)),true,theorem(X0),true) = true,
inference(demodulation,[status(thm)],[c_4811,c_123]) ).
tcf(c_5195,plain,
ifeq(true,true,theorem(or(iPr_def_19,iPr_def_14)),true) = true,
inference(superposition,[status(thm)],[c_4792,c_359]) ).
tcf(c_5199,plain,
theorem(or(iPr_def_19,iPr_def_14)) = true,
inference(demodulation,[status(thm)],[c_5195,c_123]) ).
tcf(c_5625,plain,
ifeq(true,true,theorem(or(iPr_def_14,iPr_def_19)),true) = true,
inference(superposition,[status(thm)],[c_5199,c_572]) ).
tcf(c_5626,plain,
theorem(or(iPr_def_14,iPr_def_19)) = true,
inference(demodulation,[status(thm)],[c_5625,c_123]) ).
tcf(c_6267,plain,
! [X0: $i] : ifeq(theorem(or(not(or(iPr_def_14,iPr_def_19)),X0)),true,ifeq(true,true,theorem(X0),true),true) = true,
inference(superposition,[status(thm)],[c_5626,c_116]) ).
tcf(c_6307,plain,
! [X0: $i] : ifeq(theorem(or(not(or(iPr_def_14,iPr_def_19)),X0)),true,theorem(X0),true) = true,
inference(demodulation,[status(thm)],[c_6267,c_123]) ).
tcf(c_21590,plain,
ifeq(true,true,theorem(or(not(or(iPr_def_14,iPr_def_19)),or(not(or(iPr_def_10,iPr_def_13)),iPr_def_20))),true) = true,
inference(superposition,[status(thm)],[c_1316,c_122]) ).
tcf(c_21591,plain,
theorem(or(not(or(iPr_def_14,iPr_def_19)),or(not(or(iPr_def_10,iPr_def_13)),iPr_def_20))) = true,
inference(demodulation,[status(thm)],[c_21590,c_123]) ).
tcf(c_38408,plain,
ifeq(true,true,theorem(or(not(or(iPr_def_10,iPr_def_13)),iPr_def_20)),true) = true,
inference(superposition,[status(thm)],[c_21591,c_6307]) ).
tcf(c_38409,plain,
theorem(or(not(or(iPr_def_10,iPr_def_13)),iPr_def_20)) = true,
inference(demodulation,[status(thm)],[c_38408,c_123]) ).
tcf(c_40796,plain,
ifeq(true,true,theorem(iPr_def_20),true) = true,
inference(superposition,[status(thm)],[c_38409,c_4846]) ).
tcf(c_40797,plain,
true = iPr_def_21,
inference(demodulation,[status(thm)],[c_40796,c_123,c_114]) ).
tcf(c_41542,plain,
iPr_def_21 != iPr_def_21,
inference(demodulation,[status(thm)],[c_115,c_40797]) ).
tcf(c_41543,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_41542]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL341-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.38 % Computer : n004.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Wed Sep 23 22:54:06 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running UEQ theorem proving
% 0.09/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 19.49/3.24 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 19.49/3.24 % SZS status Started for theBenchmark.p
% 19.49/3.24 % SZS status Unsatisfiable for theBenchmark.p
% 19.49/3.24
% 19.49/3.24 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 19.49/3.24
% 19.49/3.24 % ------ iProver source info
% 19.49/3.24
% 19.49/3.24 % git: date: 2026-07-19 20:42:38 +0200
% 19.49/3.24 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 19.49/3.24 % git: non_committed_changes: false
% 19.49/3.24
% 19.49/3.24 % ------ Parsing...% successful
% 19.49/3.24
% 19.49/3.24
% 19.49/3.24 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 19.49/3.24
% 19.49/3.24 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 19.49/3.24
% 19.49/3.24 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 19.49/3.24
% 19.49/3.24 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 19.49/3.24 % ------ Proving...
% 19.49/3.24 % ------ Problem Properties
% 19.49/3.24
% 19.49/3.24 %
% 19.49/3.24 % clauses 21
% 19.49/3.24 % conjectures 1
% 19.49/3.24 % EPR 1
% 19.49/3.24 % Horn 21
% 19.49/3.24 % unary 21
% 19.49/3.24 % binary 0
% 19.49/3.24 % lits 21
% 19.49/3.24 % lits eq 21
% 19.49/3.24 % fd_pure 0
% 19.49/3.24 % fd_pseudo 0
% 19.49/3.24 % fd_cond 0
% 19.49/3.24 % fd_pseudo_cond 0
% 19.49/3.24 % AC symbols 0
% 19.49/3.24
% 19.49/3.24 % ------ Input Options Time Limit: Unbounded
% 19.49/3.24
% 19.49/3.24
% 19.49/3.24 % ------
% 19.49/3.24 % Current options:
% 19.49/3.24 % ------
% 19.49/3.24
% 19.49/3.24
% 19.49/3.24 %
% 19.49/3.24
% 19.49/3.24 % ------ Proving...
% 19.49/3.24 %
% 19.49/3.24
% 19.49/3.24 % SZS status Unsatisfiable for theBenchmark.p
% 19.49/3.24
% 19.49/3.24 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 19.49/3.24
% 19.49/3.24
%------------------------------------------------------------------------------