%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET020-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n016.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:46:06 PM UTC 2026
% Result : Unsatisfiable 229.09s 35.58s
% Output : CNFRefutation 229.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 57 ( 15 unt; 0 def)
% Number of atoms : 153 ( 64 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 190 ( 94 ~; 96 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 0 sgn 92 !; 0 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
| member(f1(X0,X1),X1)
| member(f1(X0,X1),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',extensionality2) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
| ~ member(f1(X0,X1),X1)
| ~ member(f1(X0,X1),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',extensionality3) ).
fof(f9,axiom,
! [X0] : singleton_set(X0) = non_ordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',singleton_set) ).
fof(f10,axiom,
! [X0,X1] : ordered_pair(X0,X1) = non_ordered_pair(singleton_set(X0),non_ordered_pair(X0,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair) ).
fof(f17,axiom,
! [X0,X1] :
( little_set(f4(X0,X1))
| ~ member(X0,first(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',first1) ).
fof(f19,axiom,
! [X0,X1] :
( X1 = ordered_pair(f4(X0,X1),f5(X0,X1))
| ~ member(X0,first(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',first3) ).
fof(f20,plain,
! [X0,X1] :
( ordered_pair(f4(X0,X1),f5(X0,X1)) = X1
| ~ member(X0,first(X1)) ),
inference(reorient_equations,[],[f19]) ).
fof(f21,axiom,
! [X0,X1] :
( member(X0,f4(X0,X1))
| ~ member(X0,first(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',first4) ).
fof(f22,axiom,
! [X2,X3,X0,X1] :
( ~ member(X0,X2)
| X1 != ordered_pair(X2,X3)
| ~ little_set(X3)
| ~ little_set(X2)
| member(X0,first(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',first5) ).
fof(f23,plain,
! [X2,X3,X0,X1] :
( ~ member(X0,X2)
| ordered_pair(X2,X3) != X1
| ~ little_set(X3)
| ~ little_set(X2)
| member(X0,first(X1)) ),
inference(reorient_equations,[],[f22]) ).
fof(f162,axiom,
! [X2,X3,X0,X1] :
( X0 = X1
| ordered_pair(X0,X2) != ordered_pair(X1,X3)
| ~ little_set(X1)
| ~ little_set(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',first_components_are_equal) ).
fof(f163,plain,
! [X2,X3,X0,X1] :
( X0 = X1
| ordered_pair(X1,X3) != ordered_pair(X0,X2)
| ~ little_set(X1)
| ~ little_set(X0) ),
inference(reorient_equations,[],[f162]) ).
fof(f164,axiom,
! [X2,X0,X1] :
( X0 = X1
| non_ordered_pair(X2,X0) != non_ordered_pair(X2,X1)
| ~ little_set(X1)
| ~ little_set(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_cancellation) ).
fof(f167,axiom,
little_set(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_little_set) ).
fof(f168,axiom,
little_set(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_little_set) ).
fof(f169,negated_conjecture,
first(ordered_pair(a,b)) != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_first_is_first) ).
fof(f170,plain,
a != first(ordered_pair(a,b)),
inference(reorient_equations,[],[f169]) ).
fof(f172,plain,
! [X0,X1] : ordered_pair(X0,X1) = non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)),
inference(definition_unfolding,[],[f10,f9]) ).
fof(f176,plain,
! [X0,X1] :
( non_ordered_pair(non_ordered_pair(f4(X0,X1),f4(X0,X1)),non_ordered_pair(f4(X0,X1),f5(X0,X1))) = X1
| ~ member(X0,first(X1)) ),
inference(definition_unfolding,[],[f20,f172]) ).
fof(f177,plain,
! [X2,X3,X0,X1] :
( ~ member(X0,X2)
| non_ordered_pair(non_ordered_pair(X2,X2),non_ordered_pair(X2,X3)) != X1
| ~ little_set(X3)
| ~ little_set(X2)
| member(X0,first(X1)) ),
inference(definition_unfolding,[],[f23,f172]) ).
fof(f199,plain,
! [X2,X3,X0,X1] :
( X0 = X1
| non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X3)) != non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X2))
| ~ little_set(X1)
| ~ little_set(X0) ),
inference(definition_unfolding,[],[f163,f172,f172]) ).
fof(f201,plain,
a != first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),
inference(definition_unfolding,[],[f170,f172]) ).
fof(f205,plain,
! [X2,X3,X0] :
( ~ member(X0,X2)
| ~ little_set(X3)
| ~ little_set(X2)
| member(X0,first(non_ordered_pair(non_ordered_pair(X2,X2),non_ordered_pair(X2,X3)))) ),
inference(equality_resolution,[],[f177]) ).
tcf(c_199,plain,
! [X0: $i,X1: $i] :
( member(f1(X0,X1),X1)
| member(f1(X0,X1),X0)
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_200,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ member(f1(X0,X1),X1)
| ~ member(f1(X0,X1),X0) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_209,plain,
! [X0: $i,X1: $i] :
( little_set(f4(X0,X1))
| ~ member(X0,first(X1)) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_211,plain,
! [X0: $i,X1: $i] :
( ( non_ordered_pair(non_ordered_pair(f4(X0,X1),f4(X0,X1)),non_ordered_pair(f4(X0,X1),f5(X0,X1))) = X1 )
| ~ member(X0,first(X1)) ),
inference(cnf_transformation,[],[f176]) ).
tcf(c_212,plain,
! [X0: $i,X1: $i] :
( member(X0,f4(X0,X1))
| ~ member(X0,first(X1)) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_213,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,first(non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,X2))))
| ~ little_set(X2)
| ~ little_set(X1)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f205]) ).
tcf(c_332,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X0 = X2 )
| ~ little_set(X2)
| ~ little_set(X0)
| ( non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)) != non_ordered_pair(non_ordered_pair(X2,X2),non_ordered_pair(X2,X3)) ) ),
inference(cnf_transformation,[],[f199]) ).
tcf(c_333,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ little_set(X2)
| ~ little_set(X1)
| ( non_ordered_pair(X0,X1) != non_ordered_pair(X0,X2) ) ),
inference(cnf_transformation,[],[f164]) ).
tcf(c_336,plain,
little_set(a),
inference(cnf_transformation,[],[f167]) ).
tcf(c_337,plain,
little_set(b),
inference(cnf_transformation,[],[f168]) ).
tcf(c_338,negated_conjecture,
first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))) != a,
inference(cnf_transformation,[],[f201]) ).
tcf(c_9217,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_9219,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_9224,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( member(X0,X2)
| ~ member(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_10787,plain,
( member(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),a)
| member(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))))
| ( first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))) = a ) ),
inference(instantiation,[status(thm)],[c_199]) ).
tcf(c_10788,plain,
! [X0: $i,X1: $i] :
( ( X1 = a )
| ~ little_set(a)
| ~ little_set(X1)
| ( non_ordered_pair(X0,X1) != non_ordered_pair(X0,a) ) ),
inference(instantiation,[status(thm)],[c_333]) ).
tcf(c_10797,plain,
! [X0: $i,X1: $i] :
( member(X0,first(non_ordered_pair(non_ordered_pair(X1,X1),non_ordered_pair(X1,b))))
| ~ little_set(b)
| ~ little_set(X1)
| ~ member(X0,X1) ),
inference(instantiation,[status(thm)],[c_213]) ).
tcf(c_10804,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = a )
| ~ little_set(a)
| ~ little_set(X0)
| ( non_ordered_pair(non_ordered_pair(X0,X0),non_ordered_pair(X0,X1)) != non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,X2)) ) ),
inference(instantiation,[status(thm)],[c_332]) ).
tcf(c_11498,plain,
( ( non_ordered_pair(non_ordered_pair(f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)))),non_ordered_pair(f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),f5(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))))) = non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)) )
| ~ member(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)))) ),
inference(instantiation,[status(thm)],[c_211]) ).
tcf(c_11499,plain,
( member(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))))
| ~ member(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)))) ),
inference(instantiation,[status(thm)],[c_212]) ).
tcf(c_11501,plain,
( little_set(f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))))
| ~ member(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)))) ),
inference(instantiation,[status(thm)],[c_209]) ).
tcf(c_11532,plain,
! [X0: $i,X1: $i] :
( ( a = X0 )
| ( a != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_9219]) ).
tcf(c_12639,plain,
! [X0: $i] :
( ( a = a )
| ~ little_set(a)
| ( non_ordered_pair(X0,a) != non_ordered_pair(X0,a) ) ),
inference(instantiation,[status(thm)],[c_10788]) ).
tcf(c_12640,plain,
! [X0: $i] : non_ordered_pair(X0,a) = non_ordered_pair(X0,a),
inference(instantiation,[status(thm)],[c_9217]) ).
tcf(c_13028,plain,
( ( first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))) = a )
| ~ member(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),a)
| ~ member(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)))) ),
inference(instantiation,[status(thm)],[c_200]) ).
tcf(c_13338,plain,
( member(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))))
| ~ little_set(b)
| ~ little_set(a)
| ~ member(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),a) ),
inference(instantiation,[status(thm)],[c_10797]) ).
tcf(c_16225,plain,
! [X0: $i,X1: $i] :
( member(X0,X1)
| ~ member(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))))
| ( X1 != f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))) )
| ( X0 != f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a) ) ),
inference(instantiation,[status(thm)],[c_9224]) ).
tcf(c_17025,plain,
f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a) = f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),
inference(instantiation,[status(thm)],[c_9217]) ).
tcf(c_22683,plain,
! [X0: $i] :
( ( a = X0 )
| ( a != a )
| ( X0 != a ) ),
inference(instantiation,[status(thm)],[c_11532]) ).
tcf(c_34797,plain,
! [X0: $i] :
( member(X0,a)
| ~ member(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))))
| ( a != f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))) )
| ( X0 != f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a) ) ),
inference(instantiation,[status(thm)],[c_16225]) ).
tcf(c_47455,plain,
( member(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),a)
| ~ member(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))))
| ( a != f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))) )
| ( f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a) != f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a) ) ),
inference(instantiation,[status(thm)],[c_34797]) ).
tcf(c_67406,plain,
( ( a = f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))) )
| ( a != a )
| ( f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))) != a ) ),
inference(instantiation,[status(thm)],[c_22683]) ).
tcf(c_219835,plain,
( ( f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))) = a )
| ~ little_set(a)
| ~ little_set(f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))))
| ( non_ordered_pair(non_ordered_pair(f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)))),non_ordered_pair(f4(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),f5(f1(first(non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))),a),non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b))))) != non_ordered_pair(non_ordered_pair(a,a),non_ordered_pair(a,b)) ) ),
inference(instantiation,[status(thm)],[c_10804]) ).
tcf(c_219836,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_219835,c_67406,c_47455,c_17025,c_13338,c_13028,c_12640,c_12639,c_11498,c_11499,c_11501,c_10787,c_338,c_336,c_337]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET020-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n016.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 09:17:27 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 229.09/35.58 % SZS status Started for theBenchmark.p
% 229.09/35.58 % SZS status Unsatisfiable for theBenchmark.p
% 229.09/35.58
% 229.09/35.58 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 229.09/35.58
% 229.09/35.58 % ------ iProver source info
% 229.09/35.58
% 229.09/35.58 % git: date: 2026-07-19 20:42:38 +0200
% 229.09/35.58 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 229.09/35.58 % git: non_committed_changes: false
% 229.09/35.58
% 229.09/35.58 % ------ Parsing...% successful
% 229.09/35.58
% 229.09/35.58
% 229.09/35.58 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 229.09/35.58
% 229.09/35.58 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 229.09/35.58
% 229.09/35.58 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 229.09/35.58
% 229.09/35.58 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 229.09/35.58 % ------ Proving...
% 229.09/35.58 % ------ Problem Properties
% 229.09/35.58
% 229.09/35.58 %
% 229.09/35.58 % clauses 136
% 229.09/35.58 % conjectures 1
% 229.09/35.58 % EPR 23
% 229.09/35.58 % Horn 117
% 229.09/35.58 % unary 8
% 229.09/35.58 % binary 89
% 229.09/35.58 % lits 339
% 229.09/35.58 % lits eq 34
% 229.09/35.58 % fd_pure 0
% 229.09/35.58 % fd_pseudo 0
% 229.09/35.58 % fd_cond 4
% 229.09/35.58 % fd_pseudo_cond 10
% 229.09/35.58 % AC symbols 0
% 229.09/35.58
% 229.09/35.58 % ------ Input Options Time Limit: Unbounded
% 229.09/35.58
% 229.09/35.58
% 229.09/35.58 % ------
% 229.09/35.58 % Current options:
% 229.09/35.58 % ------
% 229.09/35.58
% 229.09/35.58
% 229.09/35.58 %
% 229.09/35.58
% 229.09/35.58 % ------ Proving...
% 229.09/35.58 %
% 229.09/35.58
% 229.09/35.58 % SZS status Unsatisfiable for theBenchmark.p
% 229.09/35.58
% 229.09/35.58 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 229.09/35.58
% 229.09/35.58
%------------------------------------------------------------------------------