%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL096-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n017.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:38 PM UTC 2026
% Result : Unsatisfiable 2.76s 2.41s
% Output : CNFRefutation 2.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 32 unt; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 124 ( 0 sgn 124 !; 0 ?; 89 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f2,axiom,
! [X0,X1] : ifeq(is_a_theorem(equivalent(X0,X1)),true,ifeq(is_a_theorem(X0),true,is_a_theorem(X1),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f3,plain,
! [X0,X1] : true = ifeq(is_a_theorem(equivalent(X0,X1)),true,ifeq(is_a_theorem(X0),true,is_a_theorem(X1),true),true),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_2) ).
fof(f5,plain,
! [X2,X3,X0,X1] : true = is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
inference(reorient_equations,[],[f4]) ).
fof(f6,axiom,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_3) ).
fof(f7,plain,
! [X2,X3,X0,X1,X4] : true = is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)),
inference(reorient_equations,[],[f6]) ).
fof(f8,axiom,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),X3),equivalent(equivalent(equivalent(X0,X4),X2),equivalent(equivalent(X1,X4),X3)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_4) ).
fof(f9,plain,
! [X2,X3,X0,X1,X4] : true = is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),X3),equivalent(equivalent(equivalent(X0,X4),X2),equivalent(equivalent(X1,X4),X3)))),
inference(reorient_equations,[],[f8]) ).
fof(f10,negated_conjecture,
is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_1) ).
fof(f11,plain,
true != is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)),
inference(reorient_equations,[],[f10]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(X0,X0,X1,X2) = X1,
inference(cnf_transformation,[],[f1]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : ifeq(is_a_theorem(equivalent(X0,X1)),true,ifeq(is_a_theorem(X0),true,is_a_theorem(X1),true),true) = true,
inference(cnf_transformation,[],[f3]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)) = true,
inference(cnf_transformation,[],[f5]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)) = true,
inference(cnf_transformation,[],[f7]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),X3),equivalent(equivalent(equivalent(X0,X4),X2),equivalent(equivalent(X1,X4),X3)))) = true,
inference(cnf_transformation,[],[f9]) ).
tcf(c_60,negated_conjecture,
is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)) != true,
inference(cnf_transformation,[],[f11]) ).
tcf(c_1501,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4),X5)),true,ifeq(true,true,is_a_theorem(X5),true),true) = true,
inference(superposition,[status(thm)],[c_58,c_56]) ).
tcf(c_1503,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : ifeq(true,true,ifeq(is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),X3)),true,is_a_theorem(equivalent(equivalent(equivalent(X0,X4),X2),equivalent(equivalent(X1,X4),X3))),true),true) = true,
inference(superposition,[status(thm)],[c_59,c_56]) ).
tcf(c_1507,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : ifeq(is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),X3)),true,is_a_theorem(equivalent(equivalent(equivalent(X0,X4),X2),equivalent(equivalent(X1,X4),X3))),true) = true,
inference(demodulation,[status(thm)],[c_1503,c_55]) ).
tcf(c_1511,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4),X5)),true,is_a_theorem(X5),true) = true,
inference(demodulation,[status(thm)],[c_1501,c_55]) ).
tcf(c_1536,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : ifeq(true,true,is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),X4),equivalent(equivalent(equivalent(X1,X2),X3),X4))),true) = true,
inference(superposition,[status(thm)],[c_57,c_1507]) ).
tcf(c_1537,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : ifeq(true,true,is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),X4),X5),equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),X5))),true) = true,
inference(superposition,[status(thm)],[c_58,c_1507]) ).
tcf(c_1572,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),X4),equivalent(equivalent(equivalent(X1,X2),X3),X4))) = true,
inference(demodulation,[status(thm)],[c_1536,c_55]) ).
tcf(c_1575,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),X4),X5),equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),X5))) = true,
inference(demodulation,[status(thm)],[c_1537,c_55]) ).
tcf(c_1684,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : ifeq(true,true,ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),X4)),true,is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X4)),true),true) = true,
inference(superposition,[status(thm)],[c_1572,c_56]) ).
tcf(c_1753,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : ifeq(true,true,is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2))),X4),X4)),true) = true,
inference(superposition,[status(thm)],[c_1575,c_1511]) ).
tcf(c_1796,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2))),X4),X4)) = true,
inference(demodulation,[status(thm)],[c_1753,c_55]) ).
tcf(c_1806,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),X4)),true,is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X4)),true) = true,
inference(demodulation,[status(thm)],[c_1684,c_55]) ).
tcf(c_4402,plain,
! [X0: $i,X1: $i,X2: $i] : ifeq(true,true,is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X1),X0)),X2),X2)),true) = true,
inference(superposition,[status(thm)],[c_1796,c_1806]) ).
tcf(c_4609,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X1),X0)),X2),X2)) = true,
inference(demodulation,[status(thm)],[c_4402,c_55]) ).
tcf(c_4718,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_60,c_4609]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL096-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.59 % Computer : n017.cluster.edu
% 0.09/0.59 % Model : x86_64 x86_64
% 0.09/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.59 % Memory : 8046.5625MB
% 0.09/0.59 % OS : Linux 6.8.0-71-generic
% 0.09/0.59 % CPULimit : 300
% 0.09/0.59 % WCLimit : 300
% 0.09/0.59 % DateTime : Wed Sep 23 21:49:16 UTC 2026
% 0.09/0.59 % CPUTime :
% 0.09/0.59 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.62 Running UEQ theorem proving
% 0.09/0.62 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.63
% 0.14/0.63 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.63
% 0.14/0.63 % Detected problem language: tptp
% 0.14/0.64 % Proving...
% 2.76/2.41 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.76/2.41 % SZS status Started for theBenchmark.p
% 2.76/2.41 % SZS status Unsatisfiable for theBenchmark.p
% 2.76/2.41
% 2.76/2.41 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.76/2.41
% 2.76/2.41 % ------ iProver source info
% 2.76/2.41
% 2.76/2.41 % git: date: 2026-07-19 20:42:38 +0200
% 2.76/2.41 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.76/2.41 % git: non_committed_changes: false
% 2.76/2.41
% 2.76/2.41 % ------ Parsing...% successful
% 2.76/2.41
% 2.76/2.41
% 2.76/2.41 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.76/2.41 % ------ Proving...
% 2.76/2.41 % ------ Problem Properties
% 2.76/2.41
% 2.76/2.41 %
% 2.76/2.41 % clauses 6
% 2.76/2.41 % conjectures 1
% 2.76/2.41 % EPR 0
% 2.76/2.41 % Horn 6
% 2.76/2.41 % unary 6
% 2.76/2.41 % binary 0
% 2.76/2.41 % lits 6
% 2.76/2.41 % lits eq 6
% 2.76/2.41 % fd_pure 0
% 2.76/2.41 % fd_pseudo 0
% 2.76/2.41 % fd_cond 0
% 2.76/2.41 % fd_pseudo_cond 0
% 2.76/2.41 % AC symbols 0
% 2.76/2.41
% 2.76/2.41 % ------ Input Options Time Limit: Unbounded
% 2.76/2.41
% 2.76/2.41
% 2.76/2.41 % ------
% 2.76/2.41 % Current options:
% 2.76/2.41 % ------
% 2.76/2.41
% 2.76/2.41
% 2.76/2.41 %
% 2.76/2.41
% 2.76/2.41 % ------ Proving...
% 2.76/2.41 %
% 2.76/2.41
% 2.76/2.41 % SZS status Unsatisfiable for theBenchmark.p
% 2.76/2.41
% 2.76/2.41 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.76/2.41
% 2.76/2.41
%------------------------------------------------------------------------------