%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL015-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n014.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:25 PM UTC 2026
% Result : Unsatisfiable 49.89s 8.90s
% Output : CNFRefutation 49.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 3
% Syntax : Number of formulae : 45 ( 13 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 98 ( 50 ~; 48 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 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 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 125 ( 0 sgn 125 !; 0 ?; 120 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,equivalent(equivalent(X1,X2),X0)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yrm) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(a,b)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wn) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,equivalent(equivalent(X1,X2),X0)))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(a,b)))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(equivalent(X1,X2),X0)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X1,X2),X0))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_72,c_52]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_76,c_52]) ).
tcf(c_112,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(equivalent(X1,X2),X0)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_141,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X0),X2)),X3)) ),
inference(superposition,[status(thm)],[c_53,c_89]) ).
tcf(c_142,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X2,X0))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),X3)) ),
inference(superposition,[status(thm)],[c_112,c_89]) ).
tcf(c_175,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X0),X2))) ),
inference(superposition,[status(thm)],[c_53,c_141]) ).
tcf(c_198,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(equivalent(X1,X2),X0)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_217,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X0),X2))) ),
inference(superposition,[status(thm)],[c_198,c_175]) ).
tcf(c_254,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,equivalent(X2,X0))),X2),X1)),
inference(superposition,[status(thm)],[c_53,c_217]) ).
tcf(c_283,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X0),equivalent(X2,X3)))) ),
inference(superposition,[status(thm)],[c_53,c_142]) ).
tcf(c_286,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(X0,X1)))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_254,c_142]) ).
tcf(c_348,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(equivalent(X1,X2),X0)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_403,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X0),X2))) ),
inference(superposition,[status(thm)],[c_348,c_175]) ).
tcf(c_449,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X0,equivalent(X2,X1))))) ),
inference(superposition,[status(thm)],[c_53,c_283]) ).
tcf(c_450,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X0))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_348,c_283]) ).
tcf(c_539,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,X0))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_286,c_403]) ).
tcf(c_594,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(equivalent(X1,X2),X0)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_601,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X1,X2),X0))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_594,c_52]) ).
tcf(c_627,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X0),X2)),X2)) ),
inference(superposition,[status(thm)],[c_53,c_450]) ).
tcf(c_633,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X0,X1),X2)),X2))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_53,c_539]) ).
tcf(c_687,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_601,c_627]) ).
tcf(c_697,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X2)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X0),X2))) ),
inference(superposition,[status(thm)],[c_633,c_52]) ).
tcf(c_875,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_594,c_697]) ).
tcf(c_29563,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(equivalent(X1,X2),X0)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_29594,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X0),X2))) ),
inference(superposition,[status(thm)],[c_53,c_875]) ).
tcf(c_29606,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,equivalent(X2,X0))),X2),X1)),
inference(superposition,[status(thm)],[c_53,c_29594]) ).
tcf(c_29733,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X2,equivalent(X0,equivalent(X1,X2))))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_29606,c_687]) ).
tcf(c_29841,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X2,X1),X0))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_29733,c_29594]) ).
tcf(c_29844,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X0))) ),
inference(superposition,[status(thm)],[c_29733,c_449]) ).
tcf(c_29849,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_29563,c_29844]) ).
tcf(c_29856,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X0),X2)),equivalent(X2,X1))),
inference(superposition,[status(thm)],[c_53,c_29849]) ).
tcf(c_29874,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X2,X0),X1))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_29856,c_539]) ).
tcf(c_29999,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X2),X0)),X2)),
inference(superposition,[status(thm)],[c_29856,c_29841]) ).
tcf(c_30836,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X2,X0),X1))),
inference(superposition,[status(thm)],[c_29999,c_29874]) ).
tcf(c_31545,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X1,equivalent(X2,X0)))),
inference(superposition,[status(thm)],[c_30836,c_29849]) ).
tcf(c_32565,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X0)),X1)),
inference(superposition,[status(thm)],[c_31545,c_29874]) ).
tcf(c_37612,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,equivalent(X0,X1)))),
inference(superposition,[status(thm)],[c_32565,c_29841]) ).
tcf(c_37624,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_54,c_37612]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL015-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n014.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Wed Sep 23 21:37:03 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.41
% 0.11/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.41
% 0.11/0.41 % Detected problem language: tptp
% 0.11/0.42 % Proving...
% 49.89/8.90 % SZS status Started for theBenchmark.p
% 49.89/8.90 % SZS status Unsatisfiable for theBenchmark.p
% 49.89/8.90
% 49.89/8.90 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 49.89/8.90
% 49.89/8.90 % ------ iProver source info
% 49.89/8.90
% 49.89/8.90 % git: date: 2026-07-19 20:42:38 +0200
% 49.89/8.90 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 49.89/8.90 % git: non_committed_changes: false
% 49.89/8.90
% 49.89/8.90 % ------ Parsing...% successful
% 49.89/8.90
% 49.89/8.90
% 49.89/8.90 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 49.89/8.90
% 49.89/8.90 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 49.89/8.90
% 49.89/8.90 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 49.89/8.90 % ------ Proving...
% 49.89/8.90 % ------ Problem Properties
% 49.89/8.90
% 49.89/8.90 %
% 49.89/8.90 % clauses 3
% 49.89/8.90 % conjectures 1
% 49.89/8.90 % EPR 0
% 49.89/8.90 % Horn 3
% 49.89/8.90 % unary 2
% 49.89/8.90 % binary 0
% 49.89/8.90 % lits 5
% 49.89/8.90 % lits eq 0
% 49.89/8.90 % fd_pure 0
% 49.89/8.90 % fd_pseudo 0
% 49.89/8.90 % fd_cond 0
% 49.89/8.90 % fd_pseudo_cond 0
% 49.89/8.90 % AC symbols 0
% 49.89/8.90
% 49.89/8.90 % ------ Input Options Time Limit: Unbounded
% 49.89/8.90
% 49.89/8.90
% 49.89/8.90 % ------
% 49.89/8.90 % Current options:
% 49.89/8.90 % ------
% 49.89/8.90
% 49.89/8.90
% 49.89/8.90 %
% 49.89/8.90
% 49.89/8.90 % ------ Proving...
% 49.89/8.90 %
% 49.89/8.90
% 49.89/8.90 % SZS status Unsatisfiable for theBenchmark.p
% 49.89/8.90
% 49.89/8.90 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 49.89/8.90
% 49.89/8.90
%------------------------------------------------------------------------------