%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL186-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 : n006.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:53 PM UTC 2026
% Result : Unsatisfiable 0.15s 1.90s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 6 ( 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 : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 44 ( 0 sgn 44 !; 0 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f3,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f4,plain,
! [X0,X1] : true = axiom(or(not(X0),or(X1,X0))),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f6,plain,
! [X0,X1] : true = axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(reorient_equations,[],[f5]) ).
fof(f11,axiom,
! [X0] : ifeq(axiom(X0),true,theorem(X0),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
fof(f12,plain,
! [X0] : true = ifeq(axiom(X0),true,theorem(X0),true),
inference(reorient_equations,[],[f11]) ).
fof(f15,axiom,
! [X2,X0,X1] : ifeq(theorem(or(not(X0),X1)),true,ifeq(axiom(or(not(X2),X0)),true,theorem(or(not(X2),X1)),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_3) ).
fof(f16,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(X0),X1)),true,ifeq(axiom(or(not(X2),X0)),true,theorem(or(not(X2),X1)),true),true),
inference(reorient_equations,[],[f15]) ).
fof(f17,negated_conjecture,
theorem(or(not(not(p)),or(not(p),q))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f18,plain,
true != theorem(or(not(not(p)),or(not(p),q))),
inference(reorient_equations,[],[f17]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(X0,X0,X1,X2) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))) = true,
inference(cnf_transformation,[],[f4]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(cnf_transformation,[],[f6]) ).
tcf(c_65,plain,
! [X0: $i] : ifeq(axiom(X0),true,theorem(X0),true) = true,
inference(cnf_transformation,[],[f12]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(theorem(or(not(X0),X1)),true,ifeq(axiom(or(not(X2),X0)),true,theorem(or(not(X2),X1)),true),true) = true,
inference(cnf_transformation,[],[f16]) ).
tcf(c_68,negated_conjecture,
theorem(or(not(not(p)),or(not(p),q))) != true,
inference(cnf_transformation,[],[f18]) ).
tcf(c_180,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(theorem(or(not(or(X0,X1)),X2)),true,ifeq(true,true,theorem(or(not(X1),X2)),true),true) = true,
inference(superposition,[status(thm)],[c_61,c_67]) ).
tcf(c_183,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(theorem(or(not(or(X0,X1)),X2)),true,theorem(or(not(X1),X2)),true) = true,
inference(demodulation,[status(thm)],[c_180,c_59]) ).
tcf(c_208,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_914,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(demodulation,[status(thm)],[c_208,c_59]) ).
tcf(c_931,plain,
! [X0: $i,X1: $i] : ifeq(true,true,theorem(or(not(X0),or(X0,X1))),true) = true,
inference(superposition,[status(thm)],[c_914,c_183]) ).
tcf(c_1038,plain,
! [X0: $i,X1: $i] : theorem(or(not(X0),or(X0,X1))) = true,
inference(demodulation,[status(thm)],[c_931,c_59]) ).
tcf(c_1039,plain,
true != true,
inference(demodulation,[status(thm)],[c_68,c_1038]) ).
tcf(c_1040,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_1039]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL186-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.98 % Computer : n006.cluster.edu
% 0.09/0.98 % Model : x86_64 x86_64
% 0.09/0.98 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.98 % Memory : 8046.5625MB
% 0.09/0.98 % OS : Linux 6.8.0-71-generic
% 0.09/0.98 % CPULimit : 300
% 0.09/0.98 % WCLimit : 300
% 0.09/0.98 % DateTime : Wed Sep 23 22:13:46 UTC 2026
% 0.09/0.99 % CPUTime :
% 0.09/0.99 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/1.02 Running UEQ theorem proving
% 0.09/1.02 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/1.03
% 0.15/1.03 % ======== iProver multi-core TPTP/SMT =========
% 0.15/1.03
% 0.15/1.03 % Detected problem language: tptp
% 0.15/1.05 % Proving...
% 0.15/1.90 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 0.15/1.90 % SZS status Started for theBenchmark.p
% 0.15/1.90 % SZS status Unsatisfiable for theBenchmark.p
% 0.15/1.90
% 0.15/1.90 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.15/1.90
% 0.15/1.90 % ------ iProver source info
% 0.15/1.90
% 0.15/1.90 % git: date: 2026-07-19 20:42:38 +0200
% 0.15/1.90 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.15/1.90 % git: non_committed_changes: false
% 0.15/1.90
% 0.15/1.90 % ------ Parsing...% successful
% 0.15/1.90
% 0.15/1.90
% 0.15/1.90 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.15/1.90
% 0.15/1.90 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.15/1.90
% 0.15/1.90 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.15/1.90
% 0.15/1.90 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.15/1.90 % ------ Proving...
% 0.15/1.90 % ------ Problem Properties
% 0.15/1.90
% 0.15/1.90 %
% 0.15/1.90 % clauses 10
% 0.15/1.90 % conjectures 1
% 0.15/1.90 % EPR 0
% 0.15/1.90 % Horn 10
% 0.15/1.90 % unary 10
% 0.15/1.90 % binary 0
% 0.15/1.90 % lits 10
% 0.15/1.90 % lits eq 10
% 0.15/1.90 % fd_pure 0
% 0.15/1.90 % fd_pseudo 0
% 0.15/1.90 % fd_cond 0
% 0.15/1.90 % fd_pseudo_cond 0
% 0.15/1.90 % AC symbols 0
% 0.15/1.90
% 0.15/1.90 % ------ Input Options Time Limit: Unbounded
% 0.15/1.90
% 0.15/1.90
% 0.15/1.90 % ------
% 0.15/1.90 % Current options:
% 0.15/1.90 % ------
% 0.15/1.90
% 0.15/1.90
% 0.15/1.90 %
% 0.15/1.90
% 0.15/1.90 % ------ Proving...
% 0.15/1.90 %
% 0.15/1.90
% 0.15/1.90 % SZS status Unsatisfiable for theBenchmark.p
% 0.15/1.90
% 0.15/1.90 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.15/1.90
% 0.15/1.90
%------------------------------------------------------------------------------