%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV379+1 : TPTP v9.3.1. Released v3.3.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 03:17:30 PM UTC 2026
% Result : Theorem 8.28s 1.74s
% Output : CNFRefutation 8.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of formulae : 66 ( 18 unt; 0 def)
% Number of atoms : 161 ( 70 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 146 ( 51 ~; 69 |; 14 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 152 ( 3 sgn 149 !; 3 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( ~ less_than(X1,X0)
& less_than(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).
fof(f28,axiom,
! [X0,X1] :
( ok(triple(X0,X1,bad))
<=> $false ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).
fof(f29,axiom,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> X2 = bad ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax41) ).
fof(f34,axiom,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax46) ).
fof(f35,axiom,
! [X0,X1,X2,X3] :
( ( ~ contains_slb(X1,findmin_pqp_res(X0))
& X1 != create_slb )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax47) ).
fof(f36,axiom,
! [X0,X1,X2,X3] :
( ( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
& contains_slb(X1,findmin_pqp_res(X0))
& X1 != create_slb )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax48) ).
fof(f37,axiom,
! [X0,X1,X2,X3] :
( ( less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
& contains_slb(X1,findmin_pqp_res(X0))
& X1 != create_slb )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax49) ).
fof(f42,conjecture,
! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l15_co) ).
fof(f43,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
=> ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(negated_conjecture,[status(cth)],[f42]) ).
fof(f46,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(true_and_false_elimination,[],[f28]) ).
fof(f47,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(flattening,[],[f46]) ).
fof(f48,plain,
! [X0,X1,X2] :
( ( ~ contains_slb(X1,findmin_pqp_res(X0))
& X1 != create_slb )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(rectify,[],[f35]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ( strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
& contains_slb(X1,findmin_pqp_res(X0))
& X1 != create_slb )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(rectify,[],[f36]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ( less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
& contains_slb(X1,findmin_pqp_res(X0))
& X1 != create_slb )
=> findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
inference(rectify,[],[f37]) ).
fof(f52,plain,
! [X0,X1] :
( ( ~ less_than(X1,X0)
& less_than(X0,X1) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f55,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| strictly_less_than(X0,X1) ),
inference(ennf_transformation,[],[f52]) ).
fof(f56,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| strictly_less_than(X0,X1) ),
inference(flattening,[],[f55]) ).
fof(f69,plain,
! [X0,X1,X2] :
( ok(triple(X0,X1,X2))
| X2 = bad ),
inference(ennf_transformation,[],[f29]) ).
fof(f75,plain,
! [X0,X1,X2] :
( contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(ennf_transformation,[],[f48]) ).
fof(f76,plain,
! [X0,X1,X2] :
( contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(flattening,[],[f75]) ).
fof(f77,plain,
! [X0,X1,X2] :
( ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(ennf_transformation,[],[f49]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(flattening,[],[f77]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
inference(ennf_transformation,[],[f50]) ).
fof(f80,plain,
! [X0,X1,X2] :
( ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
inference(flattening,[],[f79]) ).
fof(f82,plain,
? [X0,X1,X2] :
( ~ ok(triple(X0,X1,X2))
& ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(ennf_transformation,[],[f43]) ).
fof(f89,plain,
( ~ ok(triple(sK0,sK1,sK2))
& ok(findmin_cpq_eff(triple(sK0,sK1,sK2))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f82]) ).
fof(f91,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f93,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ less_than(X0,X1)
| strictly_less_than(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f124,plain,
! [X0,X1] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f47]) ).
fof(f125,plain,
! [X2,X0,X1] :
( ok(triple(X0,X1,X2))
| bad = X2 ),
inference(cnf_transformation,[],[f69]) ).
fof(f130,plain,
! [X0,X1] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f34]) ).
fof(f131,plain,
! [X2,X0,X1] :
( contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(cnf_transformation,[],[f76]) ).
fof(f132,plain,
! [X2,X0,X1] :
( ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0)))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) ),
inference(cnf_transformation,[],[f78]) ).
fof(f133,plain,
! [X2,X0,X1] :
( ~ less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
| ~ contains_slb(X1,findmin_pqp_res(X0))
| create_slb = X1
| findmin_cpq_eff(triple(X0,X1,X2)) = triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) ),
inference(cnf_transformation,[],[f80]) ).
fof(f138,plain,
~ ok(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f89]) ).
fof(f139,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f89]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f91]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i] : ~ ok(triple(X0,X1,bad)),
inference(cnf_transformation,[],[f124]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i,X2: $i] :
( ok(triple(X1,X2,X0))
| ( X0 = bad ) ),
inference(cnf_transformation,[],[f125]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,bad),
inference(cnf_transformation,[],[f130]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i,X2: $i] :
( contains_slb(X1,findmin_pqp_res(X0))
| ( X1 = create_slb )
| ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2)) ) ),
inference(cnf_transformation,[],[f131]) ).
tcf(c_91,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = create_slb )
| ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2)) )
| ~ contains_slb(X1,findmin_pqp_res(X0))
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(cnf_transformation,[],[f132]) ).
tcf(c_92,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = create_slb )
| ( triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2) = findmin_cpq_eff(triple(X1,X0,X2)) )
| ~ contains_slb(X0,findmin_pqp_res(X1))
| ~ less_than(lookup_slb(X0,findmin_pqp_res(X1)),findmin_pqp_res(X1)) ),
inference(cnf_transformation,[],[f133]) ).
tcf(c_95,negated_conjecture,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(cnf_transformation,[],[f139]) ).
tcf(c_96,negated_conjecture,
~ ok(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f138]) ).
tcf(c_130,plain,
! [X0: $i,X1: $i] :
( strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(global_subsumption_just,[status(thm)],[c_52,c_50,c_52]) ).
tcf(c_131,plain,
! [X0: $i,X1: $i] :
( strictly_less_than(X1,X0)
| less_than(X0,X1) ),
inference(renaming,[status(thm)],[c_130]) ).
tcf(c_132,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = create_slb )
| ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2)) )
| ~ strictly_less_than(findmin_pqp_res(X0),lookup_slb(X1,findmin_pqp_res(X0))) ),
inference(global_subsumption_just,[status(thm)],[c_91,c_90,c_91]) ).
tcf(c_417,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( less_than(X2,X3)
| ( X0 = create_slb )
| ( triple(X1,update_slb(X0,findmin_pqp_res(X1)),bad) = findmin_cpq_eff(triple(X1,X0,X4)) )
| ( findmin_pqp_res(X1) != X3 )
| ( lookup_slb(X0,findmin_pqp_res(X1)) != X2 ) ),
inference(resolution_lifted,[status(thm)],[c_132,c_131]) ).
tcf(c_418,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
| ( X1 = create_slb )
| ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),bad) = findmin_cpq_eff(triple(X0,X1,X2)) ) ),
inference(unflattening,[status(thm)],[c_417]) ).
tcf(c_1199,plain,
bad = sK2,
inference(superposition,[status(thm)],[c_84,c_96]) ).
tcf(c_1200,plain,
! [X0: $i,X1: $i] : ~ ok(triple(X0,X1,sK2)),
inference(superposition,[status(thm)],[c_1199,c_83]) ).
tcf(c_1203,plain,
! [X0: $i,X1: $i] : findmin_cpq_eff(triple(X0,create_slb,X1)) = triple(X0,create_slb,sK2),
inference(demodulation,[status(thm)],[c_89,c_1199]) ).
tcf(c_1205,plain,
! [X0: $i,X1: $i,X2: $i] :
( contains_slb(X1,findmin_pqp_res(X0))
| ( X1 = create_slb )
| ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),sK2) = findmin_cpq_eff(triple(X0,X1,X2)) ) ),
inference(demodulation,[status(thm)],[c_90,c_1199]) ).
tcf(c_1216,plain,
! [X0: $i,X1: $i,X2: $i] :
( less_than(lookup_slb(X1,findmin_pqp_res(X0)),findmin_pqp_res(X0))
| ( X1 = create_slb )
| ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),sK2) = findmin_cpq_eff(triple(X0,X1,X2)) ) ),
inference(demodulation,[status(thm)],[c_418,c_1199]) ).
tcf(c_1219,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X0 = create_slb )
| ( triple(X1,update_slb(X0,findmin_pqp_res(X1)),sK2) = findmin_cpq_eff(triple(X1,X0,X3)) )
| ( triple(X1,update_slb(X0,findmin_pqp_res(X1)),X2) = findmin_cpq_eff(triple(X1,X0,X2)) )
| ~ contains_slb(X0,findmin_pqp_res(X1)) ),
inference(superposition,[status(thm)],[c_1216,c_92]) ).
tcf(c_1228,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X1 = create_slb )
| ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),sK2) = findmin_cpq_eff(triple(X0,X1,X3)) )
| ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),X2) = findmin_cpq_eff(triple(X0,X1,X2)) ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1219,c_1205]) ).
tcf(c_1290,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X1 = create_slb )
| ( triple(X0,update_slb(X1,findmin_pqp_res(X0)),X3) = findmin_cpq_eff(triple(X0,X1,X3)) )
| ~ ok(findmin_cpq_eff(triple(X0,X1,X2))) ),
inference(superposition,[status(thm)],[c_1228,c_1200]) ).
tcf(c_1398,plain,
! [X0: $i] :
( ( create_slb = sK1 )
| ( triple(sK0,update_slb(sK1,findmin_pqp_res(sK0)),X0) = findmin_cpq_eff(triple(sK0,sK1,X0)) ) ),
inference(superposition,[status(thm)],[c_95,c_1290]) ).
tcf(c_1453,plain,
( ( create_slb = sK1 )
| ~ ok(findmin_cpq_eff(triple(sK0,sK1,sK2))) ),
inference(superposition,[status(thm)],[c_1398,c_1200]) ).
tcf(c_1457,plain,
create_slb = sK1,
inference(global_subsumption_just,[status(thm)],[c_1453,c_95,c_1453]) ).
tcf(c_1473,plain,
! [X0: $i,X1: $i] : findmin_cpq_eff(triple(X0,sK1,X1)) = triple(X0,sK1,sK2),
inference(superposition,[status(thm)],[c_1457,c_1203]) ).
tcf(c_1557,plain,
ok(triple(sK0,sK1,sK2)),
inference(superposition,[status(thm)],[c_1473,c_95]) ).
tcf(c_1562,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1557,c_96]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV379+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n016.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 19:29:57 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 8.28/1.74 % SZS status Started for theBenchmark.p
% 8.28/1.74 % SZS status Theorem for theBenchmark.p
% 8.28/1.74
% 8.28/1.74 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.28/1.74
% 8.28/1.74 % ------ iProver source info
% 8.28/1.74
% 8.28/1.74 % git: date: 2026-07-19 20:42:38 +0200
% 8.28/1.74 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.28/1.74 % git: non_committed_changes: false
% 8.28/1.74
% 8.28/1.74 % ------ Parsing...
% 8.28/1.74 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 8.28/1.74
% 8.28/1.74 % ------ Preprocessing... sup_sim: 0 sf_s rm: 7 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 8.28/1.74
% 8.28/1.74 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 8.28/1.74
% 8.28/1.74 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 8.28/1.74 % ------ Proving...
% 8.28/1.74 % ------ Problem Properties
% 8.28/1.74
% 8.28/1.74 %
% 8.28/1.74 % clauses 41
% 8.28/1.74 % conjectures 2
% 8.28/1.74 % EPR 6
% 8.28/1.74 % Horn 27
% 8.28/1.74 % unary 17
% 8.28/1.74 % binary 12
% 8.28/1.74 % lits 78
% 8.28/1.74 % lits eq 28
% 8.28/1.74 % fd_pure 0
% 8.28/1.74 % fd_pseudo 0
% 8.28/1.74 % fd_cond 5
% 8.28/1.74 % fd_pseudo_cond 5
% 8.28/1.74 % AC symbols 0
% 8.28/1.74
% 8.28/1.74 % ------ Input Options Time Limit: Unbounded
% 8.28/1.74
% 8.28/1.74
% 8.28/1.74 % ------
% 8.28/1.74 % Current options:
% 8.28/1.74 % ------
% 8.28/1.74
% 8.28/1.74
% 8.28/1.74 %
% 8.28/1.74
% 8.28/1.74 % ------ Proving...
% 8.28/1.74 %
% 8.28/1.74
% 8.28/1.74 % SZS status Theorem for theBenchmark.p
% 8.28/1.74
% 8.28/1.74 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.28/1.74
% 8.28/1.74
%------------------------------------------------------------------------------