%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL011-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 : n003.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 4.41s 1.30s
% Output : CNFRefutation 4.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 50
% Number of leaves : 3
% Syntax : Number of formulae : 66 ( 17 unt; 0 def)
% Number of atoms : 136 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 190 ( 120 ~; 70 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 7 ( 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 : 124 ( 0 sgn 124 !; 0 ?; 119 :)
% 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(equivalent(X2,X0),equivalent(X1,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yqj) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(a,c),equivalent(c,b)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_yqf) ).
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(equivalent(X2,X0),equivalent(X1,X2)))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(a,c),equivalent(c,b)))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_71,plain,
! [X0: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(a,b),equivalent(equivalent(a,c),equivalent(c,b))))) ),
inference(resolution,[status(thm)],[c_52,c_54]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(a,b),equivalent(equivalent(a,c),equivalent(c,b)))))) ),
inference(resolution,[status(thm)],[c_71,c_52]) ).
tcf(c_84,plain,
! [X0: $i] :
( ~ is_a_theorem(equivalent(X0,equivalent(a,b)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(a,c),equivalent(c,b)),X0)) ),
inference(resolution,[status(thm)],[c_75,c_53]) ).
tcf(c_94,plain,
! [X0: $i] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(a,c)),equivalent(equivalent(c,b),X0)),equivalent(a,b))),
inference(resolution,[status(thm)],[c_84,c_53]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X2,X0),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_98,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X0))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_96,c_52]) ).
tcf(c_108,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,equivalent(a,c)),equivalent(equivalent(c,b),X1)),equivalent(a,b)))) ),
inference(resolution,[status(thm)],[c_94,c_52]) ).
tcf(c_110,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(equivalent(equivalent(equivalent(X3,X1),equivalent(X2,X3)),X0))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_53,c_98]) ).
tcf(c_116,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(X2,equivalent(a,c)),equivalent(equivalent(c,b),X2)),equivalent(a,b))))) ),
inference(resolution,[status(thm)],[c_108,c_52]) ).
tcf(c_142,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(equivalent(equivalent(a,b),X0))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(a,c)),equivalent(equivalent(c,b),X1)))) ),
inference(resolution,[status(thm)],[c_116,c_53]) ).
tcf(c_149,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X3,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X0))) ),
inference(superposition,[status(thm)],[c_110,c_52]) ).
tcf(c_154,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(equivalent(a,b),X1))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(X2,equivalent(a,c)),equivalent(equivalent(c,b),X2))))) ),
inference(resolution,[status(thm)],[c_142,c_52]) ).
tcf(c_183,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(equivalent(X1,equivalent(X0,equivalent(a,c))))
| ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(equivalent(c,b),X0),X1))) ),
inference(resolution,[status(thm)],[c_154,c_53]) ).
tcf(c_211,plain,
~ is_a_theorem(equivalent(equivalent(b,equivalent(c,b)),equivalent(a,equivalent(a,c)))),
inference(resolution,[status(thm)],[c_183,c_53]) ).
tcf(c_218,plain,
! [X0: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(b,equivalent(c,b)),equivalent(a,equivalent(a,c))))) ),
inference(resolution,[status(thm)],[c_211,c_52]) ).
tcf(c_222,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(b,equivalent(c,b)),equivalent(a,equivalent(a,c)))))) ),
inference(resolution,[status(thm)],[c_218,c_52]) ).
tcf(c_255,plain,
! [X0: $i] :
( ~ is_a_theorem(equivalent(X0,equivalent(b,equivalent(c,b))))
| ~ is_a_theorem(equivalent(equivalent(a,equivalent(a,c)),X0)) ),
inference(resolution,[status(thm)],[c_222,c_53]) ).
tcf(c_257,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X2,X0),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_269,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,equivalent(X1,X2))))) ),
inference(superposition,[status(thm)],[c_53,c_149]) ).
tcf(c_283,plain,
! [X0: $i] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,a),equivalent(equivalent(a,c),X0)),equivalent(b,equivalent(c,b)))),
inference(resolution,[status(thm)],[c_255,c_53]) ).
tcf(c_286,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,a),equivalent(equivalent(a,c),X1)),equivalent(b,equivalent(c,b))))) ),
inference(resolution,[status(thm)],[c_283,c_52]) ).
tcf(c_290,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(X2,a),equivalent(equivalent(a,c),X2)),equivalent(b,equivalent(c,b)))))) ),
inference(resolution,[status(thm)],[c_286,c_52]) ).
tcf(c_330,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(equivalent(equivalent(X2,equivalent(X1,X2)),X0))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_257,c_269]) ).
tcf(c_362,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(equivalent(equivalent(b,equivalent(c,b)),X0))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,a),equivalent(equivalent(a,c),X1)))) ),
inference(resolution,[status(thm)],[c_290,c_53]) ).
tcf(c_370,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(equivalent(b,equivalent(c,b)),X1))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(X2,a),equivalent(equivalent(a,c),X2))))) ),
inference(resolution,[status(thm)],[c_362,c_52]) ).
tcf(c_411,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(equivalent(X1,equivalent(X0,a)))
| ~ is_a_theorem(equivalent(equivalent(b,equivalent(c,b)),equivalent(equivalent(equivalent(a,c),X0),X1))) ),
inference(resolution,[status(thm)],[c_370,c_53]) ).
tcf(c_415,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X0))) ),
inference(superposition,[status(thm)],[c_330,c_52]) ).
tcf(c_428,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(c,b),equivalent(a,c)),equivalent(b,a))),
inference(resolution,[status(thm)],[c_411,c_53]) ).
tcf(c_449,plain,
! [X0: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(c,b),equivalent(a,c)),equivalent(b,a)))) ),
inference(resolution,[status(thm)],[c_428,c_52]) ).
tcf(c_453,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(c,b),equivalent(a,c)),equivalent(b,a))))) ),
inference(resolution,[status(thm)],[c_449,c_52]) ).
tcf(c_496,plain,
! [X0: $i] :
( ~ is_a_theorem(equivalent(equivalent(b,a),X0))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(c,b),equivalent(a,c)))) ),
inference(resolution,[status(thm)],[c_453,c_53]) ).
tcf(c_524,plain,
~ is_a_theorem(equivalent(equivalent(b,a),equivalent(b,a))),
inference(resolution,[status(thm)],[c_496,c_53]) ).
tcf(c_530,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X1))) ),
inference(superposition,[status(thm)],[c_53,c_415]) ).
tcf(c_535,plain,
! [X0: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(b,a),equivalent(b,a)))) ),
inference(resolution,[status(thm)],[c_524,c_52]) ).
tcf(c_539,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(b,a),equivalent(b,a))))) ),
inference(resolution,[status(thm)],[c_535,c_52]) ).
tcf(c_590,plain,
! [X0: $i] : is_a_theorem(equivalent(X0,X0)),
inference(superposition,[status(thm)],[c_53,c_530]) ).
tcf(c_594,plain,
is_a_theorem(equivalent(a,a)),
inference(instantiation,[status(thm)],[c_590]) ).
tcf(c_633,plain,
! [X0: $i] :
( ~ is_a_theorem(equivalent(X0,equivalent(b,a)))
| ~ is_a_theorem(equivalent(equivalent(b,a),X0)) ),
inference(resolution,[status(thm)],[c_539,c_53]) ).
tcf(c_649,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(equivalent(b,a),X1))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(b,a)))) ),
inference(resolution,[status(thm)],[c_633,c_52]) ).
tcf(c_747,plain,
! [X0: $i] :
( ~ is_a_theorem(equivalent(X0,b))
| ~ is_a_theorem(equivalent(equivalent(b,a),equivalent(a,X0))) ),
inference(resolution,[status(thm)],[c_649,c_53]) ).
tcf(c_751,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X1,b))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(b,a),equivalent(a,X1)))) ),
inference(resolution,[status(thm)],[c_747,c_52]) ).
tcf(c_870,plain,
( ~ is_a_theorem(equivalent(b,b))
| ~ is_a_theorem(equivalent(a,a)) ),
inference(resolution,[status(thm)],[c_751,c_53]) ).
tcf(c_871,plain,
~ is_a_theorem(equivalent(b,b)),
inference(global_subsumption_just,[status(thm)],[c_870,c_594,c_870]) ).
tcf(c_878,plain,
! [X0: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(b,b))) ),
inference(resolution,[status(thm)],[c_871,c_52]) ).
tcf(c_895,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(b,b)))) ),
inference(resolution,[status(thm)],[c_878,c_52]) ).
tcf(c_948,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ is_a_theorem(X2)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,equivalent(b,b))))) ),
inference(resolution,[status(thm)],[c_895,c_52]) ).
tcf(c_2142,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(equivalent(b,b),X0)) ),
inference(resolution,[status(thm)],[c_948,c_53]) ).
tcf(c_2210,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X0,b),equivalent(b,X0)),X1)) ),
inference(resolution,[status(thm)],[c_2142,c_53]) ).
tcf(c_2214,plain,
! [X0: $i,X1: $i] : ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,b)),equivalent(equivalent(b,X1),X0))),
inference(resolution,[status(thm)],[c_2210,c_53]) ).
tcf(c_2217,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,b)),equivalent(equivalent(b,X2),X1)))) ),
inference(resolution,[status(thm)],[c_2214,c_52]) ).
tcf(c_2268,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(X2,equivalent(X3,b)),equivalent(equivalent(b,X3),X2))))) ),
inference(resolution,[status(thm)],[c_2217,c_52]) ).
tcf(c_2604,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X0,b))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(b,X0),X1),X2)) ),
inference(resolution,[status(thm)],[c_2268,c_53]) ).
tcf(c_2624,plain,
! [X0: $i,X1: $i] : ~ is_a_theorem(equivalent(equivalent(equivalent(b,X0),equivalent(b,X1)),equivalent(X1,X0))),
inference(resolution,[status(thm)],[c_2604,c_53]) ).
tcf(c_2702,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(b,X1),equivalent(b,X2)),equivalent(X2,X1)))) ),
inference(resolution,[status(thm)],[c_2624,c_52]) ).
tcf(c_2723,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(b,X2),equivalent(b,X3)),equivalent(X3,X2))))) ),
inference(resolution,[status(thm)],[c_2702,c_52]) ).
tcf(c_3153,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ is_a_theorem(equivalent(equivalent(X2,X1),X0))
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(b,X1),equivalent(b,X2)))) ),
inference(resolution,[status(thm)],[c_2723,c_53]) ).
tcf(c_3173,plain,
! [X0: $i] : ~ is_a_theorem(equivalent(equivalent(b,X0),equivalent(X0,b))),
inference(resolution,[status(thm)],[c_3153,c_53]) ).
tcf(c_3176,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(X0)
| ~ is_a_theorem(equivalent(X0,equivalent(equivalent(b,X1),equivalent(X1,b)))) ),
inference(resolution,[status(thm)],[c_3173,c_52]) ).
tcf(c_3182,plain,
! [X0: $i] : ~ is_a_theorem(equivalent(X0,X0)),
inference(resolution,[status(thm)],[c_3176,c_53]) ).
tcf(c_3183,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3182,c_590]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL011-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.10/0.36 % Computer : n003.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 21:38:04 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.41 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.14/0.42
% 0.14/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.42
% 0.14/0.42 % Detected problem language: tptp
% 0.14/0.44 % Proving...
% 4.41/1.30 % SZS status Started for theBenchmark.p
% 4.41/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.41/1.30
% 4.41/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.41/1.30
% 4.41/1.30 % ------ iProver source info
% 4.41/1.30
% 4.41/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.41/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.41/1.30 % git: non_committed_changes: false
% 4.41/1.30
% 4.41/1.30 % ------ Parsing...% successful
% 4.41/1.30
% 4.41/1.30
% 4.41/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.41/1.30
% 4.41/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 4.41/1.30
% 4.41/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.41/1.30 % ------ Proving...
% 4.41/1.30 % ------ Problem Properties
% 4.41/1.30
% 4.41/1.30 %
% 4.41/1.30 % clauses 3
% 4.41/1.30 % conjectures 1
% 4.41/1.30 % EPR 0
% 4.41/1.30 % Horn 3
% 4.41/1.30 % unary 2
% 4.41/1.30 % binary 0
% 4.41/1.30 % lits 5
% 4.41/1.30 % lits eq 0
% 4.41/1.30 % fd_pure 0
% 4.41/1.30 % fd_pseudo 0
% 4.41/1.30 % fd_cond 0
% 4.41/1.30 % fd_pseudo_cond 0
% 4.41/1.30 % AC symbols 0
% 4.41/1.30
% 4.41/1.30 % ------ Input Options Time Limit: Unbounded
% 4.41/1.30
% 4.41/1.30
% 4.41/1.30 % ------
% 4.41/1.30 % Current options:
% 4.41/1.30 % ------
% 4.41/1.30
% 4.41/1.30
% 4.41/1.30 %
% 4.41/1.30
% 4.41/1.30 % ------ Proving...
% 4.41/1.30 %
% 4.41/1.30
% 4.41/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.41/1.30
% 4.41/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.41/1.30
% 4.41/1.30
%------------------------------------------------------------------------------