%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWX199+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n011.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:32:48 PM UTC 2026
% Result : Theorem 6.10s 2.60s
% Output : CNFRefutation 6.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 11
% Syntax : Number of formulae : 83 ( 52 unt; 0 def)
% Number of atoms : 128 ( 102 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 89 ( 44 ~; 37 |; 1 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 186 ( 0 sgn 180 !; 6 ?; 121 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : head(cons(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_001) ).
fof(f2,axiom,
! [X0,X1] : tail(cons(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_002) ).
fof(f5,axiom,
! [X0] : z != s(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_005) ).
fof(f6,axiom,
! [X0] : leqNat(z,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_006) ).
fof(f7,axiom,
! [X0] : ~ leqNat(s(X0),z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_007) ).
fof(f8,axiom,
! [X0,X1] :
( leqNat(s(X0),s(X1))
<=> leqNat(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_008) ).
fof(f9,axiom,
! [X0] : merge(nil,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_009) ).
fof(f10,axiom,
! [X0,X1] : merge(cons(X0,X1),nil) = cons(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_010) ).
fof(f11,axiom,
! [X0,X1,X2,X3] :
( leqNat(X0,X2)
=> merge(cons(X0,X1),cons(X2,X3)) = cons(X0,merge(X1,cons(X2,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_011) ).
fof(f12,axiom,
! [X0,X1,X2,X3] :
( ~ leqNat(X0,X2)
=> merge(cons(X0,X1),cons(X2,X3)) = cons(X2,merge(cons(X0,X1),X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_012) ).
fof(f13,conjecture,
? [X0,X1,X2] :
~ ( merge(X0,X1) = merge(X1,X0)
=> ( merge(X0,X2) = merge(X2,X0)
=> merge(X1,X2) = merge(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_013) ).
fof(f14,negated_conjecture,
~ ? [X0,X1,X2] :
~ ( merge(X0,X1) = merge(X1,X0)
=> ( merge(X0,X2) = merge(X2,X0)
=> merge(X1,X2) = merge(X2,X1) ) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f15,plain,
! [X0,X1,X2,X3] :
( ~ leqNat(X0,X2)
| merge(cons(X0,X1),cons(X2,X3)) = cons(X0,merge(X1,cons(X2,X3))) ),
inference(ennf_transformation,[],[f11]) ).
fof(f16,plain,
! [X0,X1,X2,X3] :
( leqNat(X0,X2)
| merge(cons(X0,X1),cons(X2,X3)) = cons(X2,merge(cons(X0,X1),X3)) ),
inference(ennf_transformation,[],[f12]) ).
fof(f17,plain,
! [X0,X1,X2] :
( merge(X0,X1) != merge(X1,X0)
| merge(X0,X2) != merge(X2,X0)
| merge(X1,X2) = merge(X2,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f18,plain,
! [X0,X1,X2] :
( merge(X0,X1) != merge(X1,X0)
| merge(X0,X2) != merge(X2,X0)
| merge(X1,X2) = merge(X2,X1) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ( ~ leqNat(s(X0),s(X1))
| leqNat(X0,X1) )
& ( ~ leqNat(X0,X1)
| leqNat(s(X0),s(X1)) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f20,plain,
! [X0,X1] : head(cons(X0,X1)) = X0,
inference(cnf_transformation,[],[f1]) ).
fof(f21,plain,
! [X0,X1] : tail(cons(X0,X1)) = X1,
inference(cnf_transformation,[],[f2]) ).
fof(f24,plain,
! [X0] : s(X0) != z,
inference(cnf_transformation,[],[f5]) ).
fof(f25,plain,
! [X0] : leqNat(z,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f26,plain,
! [X0] : ~ leqNat(s(X0),z),
inference(cnf_transformation,[],[f7]) ).
fof(f28,plain,
! [X0,X1] :
( ~ leqNat(X0,X1)
| leqNat(s(X0),s(X1)) ),
inference(cnf_transformation,[],[f19]) ).
fof(f29,plain,
! [X0] : merge(nil,X0) = X0,
inference(cnf_transformation,[],[f9]) ).
fof(f30,plain,
! [X0,X1] : cons(X0,X1) = merge(cons(X0,X1),nil),
inference(cnf_transformation,[],[f10]) ).
fof(f31,plain,
! [X2,X3,X0,X1] :
( ~ leqNat(X0,X2)
| merge(cons(X0,X1),cons(X2,X3)) = cons(X0,merge(X1,cons(X2,X3))) ),
inference(cnf_transformation,[],[f15]) ).
fof(f32,plain,
! [X2,X3,X0,X1] :
( leqNat(X0,X2)
| merge(cons(X0,X1),cons(X2,X3)) = cons(X2,merge(cons(X0,X1),X3)) ),
inference(cnf_transformation,[],[f16]) ).
fof(f33,plain,
! [X2,X0,X1] :
( merge(X0,X1) != merge(X1,X0)
| merge(X0,X2) != merge(X2,X0)
| merge(X1,X2) = merge(X2,X1) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : head(cons(X0,X1)) = X0,
inference(cnf_transformation,[],[f20]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] : tail(cons(X0,X1)) = X1,
inference(cnf_transformation,[],[f21]) ).
tcf(c_53,plain,
! [X0: $i] : s(X0) != z,
inference(cnf_transformation,[],[f24]) ).
tcf(c_54,plain,
! [X0: $i] : leqNat(z,X0),
inference(cnf_transformation,[],[f25]) ).
tcf(c_55,plain,
! [X0: $i] : ~ leqNat(s(X0),z),
inference(cnf_transformation,[],[f26]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( leqNat(s(X0),s(X1))
| ~ leqNat(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_58,plain,
! [X0: $i] : merge(nil,X0) = X0,
inference(cnf_transformation,[],[f29]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : merge(cons(X0,X1),nil) = cons(X0,X1),
inference(cnf_transformation,[],[f30]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( cons(X0,merge(X2,cons(X1,X3))) = merge(cons(X0,X2),cons(X1,X3)) )
| ~ leqNat(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( leqNat(X1,X0)
| ( cons(X0,merge(cons(X1,X2),X3)) = merge(cons(X1,X2),cons(X0,X3)) ) ),
inference(cnf_transformation,[],[f32]) ).
tcf(c_62,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ( merge(X1,X2) = merge(X2,X1) )
| ( merge(X0,X2) != merge(X2,X0) )
| ( merge(X0,X1) != merge(X1,X0) ) ),
inference(cnf_transformation,[],[f33]) ).
tcf(c_178,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ( merge(X1,X2) = merge(X2,X1) )
| ( merge(X0,X2) != merge(X2,X0) )
| ( merge(X0,X1) != merge(X1,X0) ) ),
inference(demodulation,[status(thm)],[c_62]) ).
tcf(c_480,plain,
! [X0: $i,X1: $i] :
( ( merge(X0,X1) = merge(X1,X0) )
| ( merge(X1,nil) != X1 )
| ( merge(X0,nil) != merge(nil,X0) ) ),
inference(superposition,[status(thm)],[c_58,c_178]) ).
tcf(c_485,plain,
! [X0: $i,X1: $i] :
( ( merge(X0,X1) = merge(X1,X0) )
| ( merge(X1,nil) != X1 )
| ( merge(X0,nil) != X0 ) ),
inference(light_normalisation,[status(thm)],[c_480,c_58]) ).
tcf(c_511,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( merge(X2,nil) = merge(nil,X2) )
| ( merge(nil,cons(X0,X1)) != cons(X0,X1) )
| ( merge(cons(X0,X1),X2) != merge(X2,cons(X0,X1)) ) ),
inference(superposition,[status(thm)],[c_59,c_178]) ).
tcf(c_515,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( merge(cons(X1,X2),X0) = merge(X0,cons(X1,X2)) )
| ( merge(X0,nil) != X0 ) ),
inference(superposition,[status(thm)],[c_59,c_485]) ).
tcf(c_522,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( merge(X2,nil) = merge(nil,X2) )
| ( merge(cons(X0,X1),X2) != merge(X2,cons(X0,X1)) ) ),
inference(ground_joinability,[status(thm)],[c_511,c_58]) ).
tcf(c_540,plain,
! [X0: $i,X1: $i,X2: $i] : cons(z,merge(cons(s(X0),X1),X2)) = merge(cons(s(X0),X1),cons(z,X2)),
inference(superposition,[status(thm)],[c_61,c_55]) ).
tcf(c_565,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : merge(cons(X0,X1),cons(X2,X3)) = merge(cons(X2,X3),cons(X0,X1)),
inference(superposition,[status(thm)],[c_59,c_515]) ).
tcf(c_580,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( merge(X2,nil) = X2 )
| ( merge(cons(X0,X1),X2) != merge(X2,cons(X0,X1)) ) ),
inference(demodulation,[status(thm)],[c_522,c_58]) ).
tcf(c_602,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( merge(cons(X3,X4),X2) = merge(X2,cons(X3,X4)) )
| ( merge(cons(X0,X1),X2) != merge(X2,cons(X0,X1)) ) ),
inference(superposition,[status(thm)],[c_565,c_178]) ).
tcf(c_608,plain,
! [X0: $i,X1: $i,X2: $i] : cons(z,merge(cons(s(X0),X1),X2)) = merge(cons(z,X2),cons(s(X0),X1)),
inference(superposition,[status(thm)],[c_565,c_540]) ).
tcf(c_663,plain,
! [X0: $i,X1: $i,X2: $i] : cons(z,merge(X0,cons(X1,X2))) = merge(cons(z,X0),cons(X1,X2)),
inference(superposition,[status(thm)],[c_54,c_60]) ).
tcf(c_664,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( cons(s(X0),merge(X2,cons(s(X1),X3))) = merge(cons(s(X0),X2),cons(s(X1),X3)) )
| ~ leqNat(X0,X1) ),
inference(superposition,[status(thm)],[c_56,c_60]) ).
tcf(c_670,plain,
! [X0: $i,X1: $i,X2: $i] : cons(z,merge(cons(s(X0),X1),X2)) = cons(z,merge(X2,cons(s(X0),X1))),
inference(demodulation,[status(thm)],[c_608,c_663]) ).
tcf(c_686,plain,
! [X0: $i,X1: $i,X2: $i] : cons(z,merge(X0,cons(X1,X2))) = merge(cons(X1,X2),cons(z,X0)),
inference(superposition,[status(thm)],[c_663,c_565]) ).
tcf(c_752,plain,
! [X0: $i,X1: $i,X2: $i] : cons(s(z),merge(X0,cons(s(X1),X2))) = merge(cons(s(z),X0),cons(s(X1),X2)),
inference(superposition,[status(thm)],[c_54,c_664]) ).
tcf(c_782,plain,
! [X0: $i,X1: $i] : cons(z,merge(X0,cons(z,X1))) = cons(z,merge(X1,cons(z,X0))),
inference(superposition,[status(thm)],[c_686,c_663]) ).
tcf(c_799,plain,
! [X0: $i] : cons(z,merge(X0,cons(z,nil))) = cons(z,cons(z,X0)),
inference(superposition,[status(thm)],[c_58,c_782]) ).
tcf(c_831,plain,
! [X0: $i,X1: $i] : tail(cons(z,merge(X0,cons(z,X1)))) = merge(X1,cons(z,X0)),
inference(superposition,[status(thm)],[c_782,c_50]) ).
tcf(c_883,plain,
! [X0: $i] : tail(cons(z,cons(z,X0))) = merge(X0,cons(z,nil)),
inference(superposition,[status(thm)],[c_799,c_50]) ).
tcf(c_926,plain,
! [X0: $i] : merge(X0,cons(z,nil)) = cons(z,X0),
inference(demodulation,[status(thm)],[c_883,c_50]) ).
tcf(c_1269,plain,
! [X0: $i,X1: $i] : merge(X0,cons(z,X1)) = merge(X1,cons(z,X0)),
inference(demodulation,[status(thm)],[c_831,c_50]) ).
tcf(c_1312,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( merge(cons(z,X0),X2) = merge(X2,cons(z,X0)) )
| ( merge(X1,X2) != merge(X2,X1) )
| ( merge(cons(z,X0),X1) != merge(X0,cons(z,X1)) ) ),
inference(superposition,[status(thm)],[c_1269,c_178]) ).
tcf(c_1321,plain,
! [X0: $i,X1: $i,X2: $i] : cons(z,merge(X0,cons(X1,X2))) = merge(X0,cons(z,cons(X1,X2))),
inference(superposition,[status(thm)],[c_1269,c_686]) ).
tcf(c_1412,plain,
! [X0: $i,X1: $i,X2: $i] : cons(s(z),merge(X0,cons(s(X1),X2))) = merge(cons(s(X1),X2),cons(s(z),X0)),
inference(superposition,[status(thm)],[c_752,c_565]) ).
tcf(c_1538,plain,
! [X0: $i,X1: $i] :
( ( merge(cons(z,X0),X1) = merge(X1,cons(z,X0)) )
| ( merge(X1,nil) != merge(nil,X1) )
| ( merge(X0,cons(z,nil)) != cons(z,X0) ) ),
inference(superposition,[status(thm)],[c_59,c_1312]) ).
tcf(c_1551,plain,
! [X0: $i,X1: $i] :
( ( merge(cons(z,X1),X0) = merge(X0,cons(z,X1)) )
| ( merge(X0,nil) != merge(nil,X0) ) ),
inference(ground_joinability,[status(thm)],[c_1538,c_926]) ).
tcf(c_1552,plain,
! [X0: $i,X1: $i] :
( ( merge(cons(z,X1),X0) = merge(X0,cons(z,X1)) )
| ( merge(X0,nil) != X0 ) ),
inference(light_normalisation,[status(thm)],[c_1551,c_58]) ).
tcf(c_1898,plain,
! [X0: $i,X1: $i,X2: $i] : tail(cons(z,merge(X0,cons(s(X1),X2)))) = merge(cons(s(X1),X2),X0),
inference(superposition,[status(thm)],[c_670,c_50]) ).
tcf(c_2139,plain,
! [X0: $i,X1: $i,X2: $i] : merge(cons(s(X0),X1),X2) = merge(X2,cons(s(X0),X1)),
inference(demodulation,[status(thm)],[c_1898,c_50]) ).
tcf(c_2182,plain,
! [X0: $i,X1: $i,X2: $i] : merge(cons(X0,X1),X2) = merge(X2,cons(X0,X1)),
inference(superposition,[status(thm)],[c_2139,c_602]) ).
tcf(c_2192,plain,
! [X0: $i] : merge(X0,nil) = X0,
inference(backward_subsumption_resolution,[status(thm)],[c_580,c_2182]) ).
tcf(c_2206,plain,
! [X0: $i,X1: $i] : merge(cons(z,X1),X0) = merge(X0,cons(z,X1)),
inference(global_subsumption_just,[status(thm)],[c_1552,c_1552,c_2192]) ).
tcf(c_2207,plain,
! [X0: $i,X1: $i] : merge(cons(z,X0),X1) = merge(X1,cons(z,X0)),
inference(renaming,[status(thm)],[c_2206]) ).
tcf(c_2245,plain,
! [X0: $i,X1: $i] : merge(cons(z,X0),X1) = merge(X0,cons(z,X1)),
inference(superposition,[status(thm)],[c_2207,c_1269]) ).
tcf(c_4222,plain,
! [X0: $i,X1: $i] : cons(s(z),merge(X0,cons(s(z),X1))) = cons(s(z),merge(X1,cons(s(z),X0))),
inference(superposition,[status(thm)],[c_1412,c_752]) ).
tcf(c_10818,plain,
! [X0: $i] : cons(s(z),merge(X0,cons(s(z),nil))) = cons(s(z),cons(s(z),X0)),
inference(superposition,[status(thm)],[c_58,c_4222]) ).
tcf(c_11368,plain,
! [X0: $i] : tail(cons(s(z),cons(s(z),X0))) = merge(X0,cons(s(z),nil)),
inference(superposition,[status(thm)],[c_10818,c_50]) ).
tcf(c_12751,plain,
! [X0: $i] : merge(X0,cons(s(z),nil)) = cons(s(z),X0),
inference(demodulation,[status(thm)],[c_11368,c_50]) ).
tcf(c_12792,plain,
! [X0: $i] : merge(X0,cons(z,cons(s(z),nil))) = cons(s(z),cons(z,X0)),
inference(superposition,[status(thm)],[c_12751,c_2245]) ).
tcf(c_13323,plain,
! [X0: $i] : cons(s(z),cons(z,X0)) = cons(z,cons(s(z),X0)),
inference(demodulation,[status(thm)],[c_12792,c_1321,c_12751]) ).
tcf(c_13336,plain,
! [X0: $i] : head(cons(z,cons(s(z),X0))) = s(z),
inference(superposition,[status(thm)],[c_13323,c_49]) ).
tcf(c_19559,plain,
s(z) = z,
inference(demodulation,[status(thm)],[c_13336,c_49]) ).
tcf(c_19560,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_19559,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWX199+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n011.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 23:35:28 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...
% 6.10/2.60 % SZS status Started for theBenchmark.p
% 6.10/2.60 % SZS status Theorem for theBenchmark.p
% 6.10/2.60
% 6.10/2.60 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.10/2.60
% 6.10/2.60 % ------ iProver source info
% 6.10/2.60
% 6.10/2.60 % git: date: 2026-07-19 20:42:38 +0200
% 6.10/2.60 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.10/2.60 % git: non_committed_changes: false
% 6.10/2.60
% 6.10/2.60 % ------ Parsing...
% 6.10/2.60 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 6.10/2.60
% 6.10/2.60 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 6.10/2.60
% 6.10/2.60 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 6.10/2.60
% 6.10/2.60 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 6.10/2.60 % ------ Proving...
% 6.10/2.60 % ------ Problem Properties
% 6.10/2.60
% 6.10/2.60 %
% 6.10/2.60 % clauses 14
% 6.10/2.60 % conjectures 1
% 6.10/2.60 % EPR 1
% 6.10/2.60 % Horn 13
% 6.10/2.60 % unary 9
% 6.10/2.60 % binary 4
% 6.10/2.60 % lits 20
% 6.10/2.60 % lits eq 12
% 6.10/2.60 % fd_pure 0
% 6.10/2.60 % fd_pseudo 0
% 6.10/2.60 % fd_cond 0
% 6.10/2.60 % fd_pseudo_cond 0
% 6.10/2.60 % AC symbols 0
% 6.10/2.60
% 6.10/2.60 % ------ Schedule dynamic 5 is on
% 6.10/2.60
% 6.10/2.60 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 6.10/2.60
% 6.10/2.60
% 6.10/2.60 % ------
% 6.10/2.60 % Current options:
% 6.10/2.60 % ------
% 6.10/2.60
% 6.10/2.60
% 6.10/2.60 %
% 6.10/2.60
% 6.10/2.60 % ------ Proving...
% 6.10/2.60 %
% 6.10/2.60
% 6.10/2.60 % SZS status Theorem for theBenchmark.p
% 6.10/2.60
% 6.10/2.60 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.10/2.60
% 6.10/2.60
%------------------------------------------------------------------------------