%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL203-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n009.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:05:58 PM UTC 2026
% Result : Unsatisfiable 34.97s 5.22s
% Output : CNFRefutation 34.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 10
% Syntax : Number of formulae : 73 ( 73 unt; 0 def)
% Number of atoms : 73 ( 72 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; 3 con; 0-4 aty)
% Number of variables : 144 ( 0 sgn 144 !; 0 ?; 99 :)
% 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,negated_conjecture,
theorem(implies(not(or(p,q)),or(not(p),not(q)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f17,plain,
true != theorem(implies(not(or(p,q)),or(not(p),not(q)))),
inference(reorient_equations,[],[f16]) ).
fof(f18,plain,
! [X0] : true = axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f2,f11]) ).
fof(f19,plain,
! [X0,X1] : true = axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f4,f11]) ).
fof(f20,plain,
! [X0,X1] : true = axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f6,f11]) ).
fof(f21,plain,
! [X2,X0,X1] : true = axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f8,f11]) ).
fof(f22,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(f23,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(f24,plain,
true != theorem(or(not(not(or(p,q))),or(not(p),not(q)))),
inference(definition_unfolding,[],[f17,f11]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(X0,X0,X1,X2) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_60,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)) = true,
inference(cnf_transformation,[],[f18]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))) = true,
inference(cnf_transformation,[],[f19]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(cnf_transformation,[],[f20]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) = true,
inference(cnf_transformation,[],[f21]) ).
tcf(c_64,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,[],[f22]) ).
tcf(c_65,plain,
! [X0: $i] : ifeq(axiom(X0),true,theorem(X0),true) = true,
inference(cnf_transformation,[],[f13]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] : ifeq(theorem(or(not(X0),X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
inference(cnf_transformation,[],[f23]) ).
tcf(c_67,negated_conjecture,
theorem(or(not(not(or(p,q))),or(not(p),not(q)))) != true,
inference(cnf_transformation,[],[f24]) ).
tcf(c_168,plain,
! [X0: $i] : ifeq(true,true,theorem(or(not(or(X0,X0)),X0)),true) = true,
inference(superposition,[status(thm)],[c_60,c_65]) ).
tcf(c_169,plain,
! [X0: $i,X1: $i] : ifeq(true,true,theorem(or(not(X0),or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[c_61,c_65]) ).
tcf(c_172,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)) = true,
inference(demodulation,[status(thm)],[c_168,c_59]) ).
tcf(c_174,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_172,c_66]) ).
tcf(c_181,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X1,X0))) = true,
inference(demodulation,[status(thm)],[c_169,c_59]) ).
tcf(c_183,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_181,c_66]) ).
tcf(c_185,plain,
! [X0: $i,X1: $i] : ifeq(true,true,ifeq(theorem(X0),true,theorem(or(X1,X0)),true),true) = true,
inference(superposition,[status(thm)],[c_181,c_66]) ).
tcf(c_190,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_174,c_59]) ).
tcf(c_213,plain,
! [X0: $i,X1: $i] : ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[c_62,c_65]) ).
tcf(c_216,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_63,c_65]) ).
tcf(c_229,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(true,true,theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),true) = true,
inference(superposition,[status(thm)],[c_64,c_65]) ).
tcf(c_231,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(demodulation,[status(thm)],[c_213,c_59]) ).
tcf(c_237,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_231,c_66]) ).
tcf(c_286,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_216,c_59]) ).
tcf(c_294,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(true,true,ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true),true) = true,
inference(superposition,[status(thm)],[c_286,c_66]) ).
tcf(c_319,plain,
! [X0: $i,X1: $i] : ifeq(theorem(X0),true,theorem(or(X1,X0)),true) = true,
inference(demodulation,[status(thm)],[c_185,c_59]) ).
tcf(c_508,plain,
! [X0: $i,X1: $i] : ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true) = true,
inference(demodulation,[status(thm)],[c_237,c_59]) ).
tcf(c_612,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_183,c_59]) ).
tcf(c_616,plain,
! [X0: $i,X1: $i] : ifeq(true,true,theorem(or(X0,or(not(X1),X1))),true) = true,
inference(superposition,[status(thm)],[c_286,c_612]) ).
tcf(c_644,plain,
! [X0: $i,X1: $i] : theorem(or(X0,or(not(X1),X1))) = true,
inference(demodulation,[status(thm)],[c_616,c_59]) ).
tcf(c_654,plain,
! [X0: $i] : ifeq(true,true,theorem(or(not(X0),X0)),true) = true,
inference(superposition,[status(thm)],[c_644,c_190]) ).
tcf(c_669,plain,
! [X0: $i] : theorem(or(not(X0),X0)) = true,
inference(demodulation,[status(thm)],[c_654,c_59]) ).
tcf(c_684,plain,
! [X0: $i] : ifeq(true,true,theorem(or(X0,not(X0))),true) = true,
inference(superposition,[status(thm)],[c_669,c_508]) ).
tcf(c_694,plain,
! [X0: $i] : theorem(or(X0,not(X0))) = true,
inference(demodulation,[status(thm)],[c_684,c_59]) ).
tcf(c_700,plain,
! [X0: $i,X1: $i] : ifeq(theorem(or(not(or(X0,not(X0))),X1)),true,ifeq(true,true,theorem(X1),true),true) = true,
inference(superposition,[status(thm)],[c_694,c_66]) ).
tcf(c_1714,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) = true,
inference(demodulation,[status(thm)],[c_229,c_59]) ).
tcf(c_4950,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(theorem(or(X0,or(X1,X2))),true,theorem(or(X1,or(X0,X2))),true) = true,
inference(demodulation,[status(thm)],[c_294,c_59]) ).
tcf(c_15982,plain,
! [X0: $i,X1: $i] : ifeq(theorem(or(not(or(X0,not(X0))),X1)),true,theorem(X1),true) = true,
inference(demodulation,[status(thm)],[c_700,c_59]) ).
tcf(c_15986,plain,
! [X0: $i,X1: $i] : ifeq(true,true,theorem(or(not(or(X0,X1)),or(X0,not(not(X1))))),true) = true,
inference(superposition,[status(thm)],[c_1714,c_15982]) ).
tcf(c_19453,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X0,not(not(X1))))) = true,
inference(demodulation,[status(thm)],[c_15986,c_59]) ).
tcf(c_19481,plain,
! [X0: $i,X1: $i] : ifeq(true,true,theorem(or(not(X0),not(not(or(X1,X0))))),true) = true,
inference(superposition,[status(thm)],[c_19453,c_612]) ).
tcf(c_20208,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),not(not(or(X1,X0))))) = true,
inference(demodulation,[status(thm)],[c_19481,c_59]) ).
tcf(c_20255,plain,
! [X0: $i,X1: $i] : ifeq(true,true,theorem(or(not(not(or(X0,X1))),not(X1))),true) = true,
inference(superposition,[status(thm)],[c_20208,c_508]) ).
tcf(c_21412,plain,
! [X0: $i,X1: $i] : theorem(or(not(not(or(X0,X1))),not(X1))) = true,
inference(demodulation,[status(thm)],[c_20255,c_59]) ).
tcf(c_21425,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(true,true,theorem(or(X0,or(not(not(or(X1,X2))),not(X2)))),true) = true,
inference(superposition,[status(thm)],[c_21412,c_319]) ).
tcf(c_29092,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(X0,or(not(not(or(X1,X2))),not(X2)))) = true,
inference(demodulation,[status(thm)],[c_21425,c_59]) ).
tcf(c_29153,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(true,true,theorem(or(not(not(or(X0,X1))),or(X2,not(X1)))),true) = true,
inference(superposition,[status(thm)],[c_29092,c_4950]) ).
tcf(c_34047,plain,
! [X0: $i,X1: $i,X2: $i] : theorem(or(not(not(or(X0,X1))),or(X2,not(X1)))) = true,
inference(demodulation,[status(thm)],[c_29153,c_59]) ).
tcf(c_34048,plain,
true != true,
inference(demodulation,[status(thm)],[c_67,c_34047]) ).
tcf(c_34049,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_34048]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL203-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.42 % Computer : n009.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Wed Sep 23 22:19:28 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.46 Running UEQ theorem proving
% 0.15/0.46 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.15/0.47
% 0.15/0.47 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.47
% 0.15/0.47 % Detected problem language: tptp
% 0.15/0.48 % Proving...
% 34.97/5.22 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 34.97/5.22 % SZS status Started for theBenchmark.p
% 34.97/5.22 % SZS status Unsatisfiable for theBenchmark.p
% 34.97/5.22
% 34.97/5.22 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 34.97/5.22
% 34.97/5.22 % ------ iProver source info
% 34.97/5.22
% 34.97/5.22 % git: date: 2026-07-19 20:42:38 +0200
% 34.97/5.22 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 34.97/5.22 % git: non_committed_changes: false
% 34.97/5.22
% 34.97/5.22 % ------ Parsing...% successful
% 34.97/5.22
% 34.97/5.22
% 34.97/5.22 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 34.97/5.22
% 34.97/5.22 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 34.97/5.22
% 34.97/5.22 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 34.97/5.22
% 34.97/5.22 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 34.97/5.22 % ------ Proving...
% 34.97/5.22 % ------ Problem Properties
% 34.97/5.22
% 34.97/5.22 %
% 34.97/5.22 % clauses 9
% 34.97/5.22 % conjectures 1
% 34.97/5.22 % EPR 0
% 34.97/5.22 % Horn 9
% 34.97/5.22 % unary 9
% 34.97/5.22 % binary 0
% 34.97/5.22 % lits 9
% 34.97/5.22 % lits eq 9
% 34.97/5.22 % fd_pure 0
% 34.97/5.22 % fd_pseudo 0
% 34.97/5.22 % fd_cond 0
% 34.97/5.22 % fd_pseudo_cond 0
% 34.97/5.22 % AC symbols 0
% 34.97/5.22
% 34.97/5.22 % ------ Input Options Time Limit: Unbounded
% 34.97/5.22
% 34.97/5.22
% 34.97/5.22 % ------
% 34.97/5.22 % Current options:
% 34.97/5.22 % ------
% 34.97/5.22
% 34.97/5.22
% 34.97/5.22 %
% 34.97/5.22
% 34.97/5.22 % ------ Proving...
% 34.97/5.22 %
% 34.97/5.22
% 34.97/5.22 % SZS status Unsatisfiable for theBenchmark.p
% 34.97/5.22
% 34.97/5.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 34.97/5.22
% 34.97/5.22
%------------------------------------------------------------------------------