%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL239-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 : n001.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:08 PM UTC 2026
% Result : Unsatisfiable 3.78s 1.28s
% Output : CNFRefutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 10
% Syntax : Number of formulae : 56 ( 56 unt; 0 def)
% Number of atoms : 56 ( 55 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-4 aty)
% Number of variables : 94 ( 0 sgn 94 !; 0 ?; 56 :)
% 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(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,negated_conjecture,
theorem(not(and(p,not(p)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f18,plain,
true != theorem(not(and(p,not(p)))),
inference(reorient_equations,[],[f17]) ).
fof(f19,plain,
! [X0] : true = axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f2,f11]) ).
fof(f20,plain,
! [X0,X1] : true = axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f4,f11]) ).
fof(f21,plain,
! [X0,X1] : true = axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f6,f11]) ).
fof(f22,plain,
! [X2,X0,X1] : true = axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f8,f11]) ).
fof(f24,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(f25,plain,
true != theorem(not(not(or(not(p),not(not(p)))))),
inference(definition_unfolding,[],[f18,f16]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(X0,X0,X1,X2) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_61,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)) = true,
inference(cnf_transformation,[],[f19]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))) = true,
inference(cnf_transformation,[],[f20]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(cnf_transformation,[],[f21]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) = true,
inference(cnf_transformation,[],[f22]) ).
tcf(c_66,plain,
! [X0: $i] : ifeq(axiom(X0),true,theorem(X0),true) = true,
inference(cnf_transformation,[],[f13]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] : ifeq(theorem(or(not(X0),X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
inference(cnf_transformation,[],[f24]) ).
tcf(c_68,negated_conjecture,
theorem(not(not(or(not(p),not(not(p)))))) != true,
inference(cnf_transformation,[],[f25]) ).
tcf(c_169,plain,
! [X0: $i] : ifeq(true,true,theorem(or(not(or(X0,X0)),X0)),true) = true,
inference(superposition,[status(thm)],[c_61,c_66]) ).
tcf(c_170,plain,
! [X0: $i,X1: $i] : ifeq(true,true,theorem(or(not(X0),or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[c_62,c_66]) ).
tcf(c_173,plain,
! [X0: $i,X1: $i] : ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[c_63,c_66]) ).
tcf(c_175,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)) = true,
inference(demodulation,[status(thm)],[c_169,c_60]) ).
tcf(c_178,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))) = true,
inference(demodulation,[status(thm)],[c_170,c_60]) ).
tcf(c_181,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(demodulation,[status(thm)],[c_173,c_60]) ).
tcf(c_184,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_64,c_66]) ).
tcf(c_190,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_181,c_67]) ).
tcf(c_191,plain,
! [X0: $i,X1: $i] : ifeq(theorem(or(not(or(not(or(X0,X0)),X0)),X1)),true,ifeq(true,true,theorem(X1),true),true) = true,
inference(superposition,[status(thm)],[c_175,c_67]) ).
tcf(c_192,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_178,c_67]) ).
tcf(c_279,plain,
! [X0: $i,X1: $i] : ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true) = true,
inference(demodulation,[status(thm)],[c_190,c_60]) ).
tcf(c_374,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_184,c_60]) ).
tcf(c_675,plain,
! [X0: $i,X1: $i] : ifeq(theorem(or(not(or(not(or(X0,X0)),X0)),X1)),true,theorem(X1),true) = true,
inference(demodulation,[status(thm)],[c_191,c_60]) ).
tcf(c_704,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_192,c_60]) ).
tcf(c_707,plain,
! [X0: $i,X1: $i] : ifeq(true,true,theorem(or(X0,or(not(X1),X1))),true) = true,
inference(superposition,[status(thm)],[c_374,c_704]) ).
tcf(c_735,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(X1),X1))) = true,
inference(demodulation,[status(thm)],[c_707,c_60]) ).
tcf(c_749,plain,
! [X0: $i] : ifeq(true,true,theorem(or(not(X0),X0)),true) = true,
inference(superposition,[status(thm)],[c_735,c_675]) ).
tcf(c_771,plain,
! [X0: $i] : theorem(or(not(X0),X0)) = true,
inference(demodulation,[status(thm)],[c_749,c_60]) ).
tcf(c_783,plain,
! [X0: $i] : ifeq(true,true,theorem(or(X0,not(X0))),true) = true,
inference(superposition,[status(thm)],[c_771,c_279]) ).
tcf(c_820,plain,
! [X0: $i] : theorem(or(X0,not(X0))) = true,
inference(demodulation,[status(thm)],[c_783,c_60]) ).
tcf(c_829,plain,
! [X0: $i] : ifeq(true,true,ifeq(theorem(X0),true,theorem(not(not(X0))),true),true) = true,
inference(superposition,[status(thm)],[c_820,c_67]) ).
tcf(c_1086,plain,
! [X0: $i] : ifeq(theorem(X0),true,theorem(not(not(X0))),true) = true,
inference(demodulation,[status(thm)],[c_829,c_60]) ).
tcf(c_1106,plain,
! [X0: $i] : ifeq(true,true,theorem(not(not(or(X0,not(X0))))),true) = true,
inference(superposition,[status(thm)],[c_820,c_1086]) ).
tcf(c_1249,plain,
! [X0: $i] : theorem(not(not(or(X0,not(X0))))) = true,
inference(demodulation,[status(thm)],[c_1106,c_60]) ).
tcf(c_1250,plain,
true != true,
inference(demodulation,[status(thm)],[c_68,c_1249]) ).
tcf(c_1251,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_1250]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL239-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.10/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Wed Sep 23 22:37:06 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running UEQ theorem proving
% 0.10/0.40 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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 3.78/1.28 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.78/1.28 % SZS status Started for theBenchmark.p
% 3.78/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 3.78/1.28
% 3.78/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.78/1.28
% 3.78/1.28 % ------ iProver source info
% 3.78/1.28
% 3.78/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.78/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.78/1.28 % git: non_committed_changes: false
% 3.78/1.28
% 3.78/1.28 % ------ Parsing...% successful
% 3.78/1.28
% 3.78/1.28
% 3.78/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.78/1.28
% 3.78/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.78/1.28
% 3.78/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.78/1.28
% 3.78/1.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.78/1.28 % ------ Proving...
% 3.78/1.28 % ------ Problem Properties
% 3.78/1.28
% 3.78/1.28 %
% 3.78/1.28 % clauses 9
% 3.78/1.28 % conjectures 1
% 3.78/1.28 % EPR 0
% 3.78/1.28 % Horn 9
% 3.78/1.28 % unary 9
% 3.78/1.28 % binary 0
% 3.78/1.28 % lits 9
% 3.78/1.28 % lits eq 9
% 3.78/1.28 % fd_pure 0
% 3.78/1.28 % fd_pseudo 0
% 3.78/1.28 % fd_cond 0
% 3.78/1.28 % fd_pseudo_cond 0
% 3.78/1.28 % AC symbols 0
% 3.78/1.28
% 3.78/1.28 % ------ Input Options Time Limit: Unbounded
% 3.78/1.28
% 3.78/1.28
% 3.78/1.28 % ------
% 3.78/1.28 % Current options:
% 3.78/1.28 % ------
% 3.78/1.28
% 3.78/1.28
% 3.78/1.28 %
% 3.78/1.28
% 3.78/1.28 % ------ Proving...
% 3.78/1.28 %
% 3.78/1.28
% 3.78/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 3.78/1.28
% 3.78/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.78/1.28
% 3.78/1.28
%------------------------------------------------------------------------------