%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWV104+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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 : Thu Sep 24 03:00:35 PM UTC 2026
% Result : Theorem 0.24s 5.71s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of formulae : 79 ( 60 unt; 0 def)
% Number of atoms : 141 ( 115 equ)
% Maximal formula atoms : 12 ( 1 avg)
% Number of connectives : 98 ( 36 ~; 28 |; 29 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 11 con; 0-3 aty)
% Number of variables : 71 ( 5 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(quaternion_ds1_inuse_0016,conjecture,
( ( a_select2(xinit_defuse,n5) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n3) = use
& a_select3(u_defuse,n2,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n0,n0) = use )
=> ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) = use
& a_select3(u_defuse,n2,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n0,n0) = use ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_inuse_0016) ).
fof(sel2_update_2,axiom,
! [X5,X7,X1,X17,X25] :
( ( a_select2(X1,X7) = X17
& X5 != X7 )
=> a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sel2_update_2) ).
fof(sel2_update_1,axiom,
! [X1,X7,X17] : a_select2(tptp_update2(X1,X7,X17),X7) = X17,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sel2_update_1) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(leq_gt_pred,axiom,
! [X1,X2] :
( leq(X1,pred(X2))
<=> gt(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt_pred) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
fof(succ_plus_1_r,axiom,
! [X1] : plus(X1,n1) = succ(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(sum_plus_base_float,axiom,
! [X23] : tptp_float_0_0 = sum(n0,tptp_minus_1,X23),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sum_plus_base_float) ).
fof(sum_plus_base,axiom,
! [X23] : sum(n0,tptp_minus_1,X23) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sum_plus_base) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(successor_2,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_2) ).
fof(succ_plus_1_l,axiom,
! [X1] : plus(n1,X1) = succ(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_l) ).
fof(successor_3,axiom,
succ(succ(succ(n0))) = n3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_3) ).
fof(successor_4,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_4) ).
fof(gt_5_4,axiom,
gt(n5,n4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_5_4) ).
fof(gt_5_3,axiom,
gt(n5,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_5_3) ).
fof(reflexivity_leq,axiom,
! [X1] : leq(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
fof(c_0_18,negated_conjecture,
~ ( ( a_select2(xinit_defuse,n5) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n3) = use
& a_select3(u_defuse,n2,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n0,n0) = use )
=> ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) = use
& a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) = use
& a_select3(u_defuse,n2,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n0,n0) = use ) ),
inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0016]) ).
fof(c_0_19,negated_conjecture,
( ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| a_select3(u_defuse,n2,n0) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n0,n0) != use )
& a_select2(xinit_defuse,n5) = use
& a_select2(xinit_defuse,n4) = use
& a_select2(xinit_defuse,n3) = use
& a_select3(u_defuse,n2,n0) = use
& a_select3(u_defuse,n1,n0) = use
& a_select3(u_defuse,n0,n0) = use ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])]) ).
fof(c_0_20,plain,
! [X5,X7,X1,X17,X25] :
( ( a_select2(X1,X7) = X17
& X5 != X7 )
=> a_select2(tptp_update2(X1,X5,X25),X7) = X17 ),
inference(fof_simplification,[status(thm)],[sel2_update_2]) ).
cnf(c_0_21,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| a_select3(u_defuse,n2,n0) != use
| a_select3(u_defuse,n1,n0) != use
| a_select3(u_defuse,n0,n0) != use ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,negated_conjecture,
a_select3(u_defuse,n0,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
a_select3(u_defuse,n1,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
a_select3(u_defuse,n2,n0) = use,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_25,plain,
! [X173,X174,X175] : a_select2(tptp_update2(X173,X174,X175),X174) = X175,
inference(variable_rename,[status(thm)],[sel2_update_1]) ).
fof(c_0_26,plain,
! [X176,X177,X178,X179,X180] :
( a_select2(tptp_update2(X178,X176,X180),X177) = X179
| a_select2(X178,X177) != X179
| X176 = X177 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
fof(c_0_27,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
fof(c_0_28,plain,
! [X46,X47] :
( ( leq(X46,pred(X47))
| ~ gt(X47,X46) )
& ( gt(X47,X46)
| ~ leq(X46,pred(X47)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])])]) ).
fof(c_0_29,plain,
! [X145] : minus(X145,n1) = pred(X145),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
fof(c_0_30,plain,
! [X135] : plus(X135,n1) = succ(X135),
inference(variable_rename,[status(thm)],[succ_plus_1_r]) ).
fof(c_0_31,plain,
! [X134] : tptp_float_0_0 = sum(n0,tptp_minus_1,X134),
inference(variable_rename,[status(thm)],[sum_plus_base_float]) ).
fof(c_0_32,plain,
! [X133] : sum(n0,tptp_minus_1,X133) = n0,
inference(variable_rename,[status(thm)],[sum_plus_base]) ).
cnf(c_0_33,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_34,plain,
a_select2(tptp_update2(X1,X2,X3),X2) = X3,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
( a_select2(X3,X2) != X4
| a_select2(tptp_update2(X3,X1,X5),X2) = X4
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_36,plain,
! [X33] : ~ gt(X33,X33),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_27])]) ).
cnf(c_0_37,plain,
( ~ leq(X1,pred(X2))
| gt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_39,plain,
! [X146] : pred(succ(X146)) = X146,
inference(variable_rename,[status(thm)],[pred_succ]) ).
cnf(c_0_40,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_41,plain,
plus(X1,n1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,plain,
tptp_float_0_0 = sum(n0,tptp_minus_1,X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,plain,
sum(n0,tptp_minus_1,X1) = n0,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,plain,
succ(succ(n0)) = n2,
inference(split_conjunct,[status(thm)],[successor_2]) ).
fof(c_0_45,plain,
! [X136] : plus(n1,X136) = succ(X136),
inference(variable_rename,[status(thm)],[succ_plus_1_l]) ).
cnf(c_0_46,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use
| a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_47,plain,
( X2 = X4
| a_select2(tptp_update2(X1,X2,X3),X4) = a_select2(X1,X4) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_48,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_49,plain,
( ~ leq(X1,minus(X2,n1))
| gt(X2,X1) ),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_50,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_51,plain,
succ(succ(succ(n0))) = n3,
inference(split_conjunct,[status(thm)],[successor_3]) ).
cnf(c_0_52,plain,
plus(n0,n1) = n1,
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_53,plain,
n0 = tptp_float_0_0,
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_54,plain,
plus(plus(n0,n1),n1) = n2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_41]),c_0_41]) ).
cnf(c_0_55,plain,
plus(n1,X1) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use
| n5 = n4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_34])]) ).
cnf(c_0_57,plain,
~ leq(X1,minus(X1,n1)),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_58,plain,
minus(plus(X1,n1),n1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_41]),c_0_38]) ).
cnf(c_0_59,plain,
succ(succ(succ(succ(n0)))) = n4,
inference(split_conjunct,[status(thm)],[successor_4]) ).
cnf(c_0_60,plain,
plus(plus(plus(n0,n1),n1),n1) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_41]),c_0_41]),c_0_41]) ).
cnf(c_0_61,plain,
plus(tptp_float_0_0,n1) = n1,
inference(rw,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_62,plain,
plus(n1,n1) = n2,
inference(rw,[status(thm)],[c_0_54,c_0_52]) ).
cnf(c_0_63,plain,
plus(n1,X1) = plus(X1,n1),
inference(rw,[status(thm)],[c_0_55,c_0_41]) ).
cnf(c_0_64,negated_conjecture,
( a_select2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n3) != use
| n5 = n4
| n5 = n3 ),
inference(spm,[status(thm)],[c_0_56,c_0_47]) ).
cnf(c_0_65,plain,
~ leq(plus(X1,n1),X1),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_66,plain,
plus(plus(plus(plus(n0,n1),n1),n1),n1) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_41]),c_0_41]),c_0_41]),c_0_41]) ).
cnf(c_0_67,plain,
plus(n1,n2) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_53]),c_0_61]),c_0_62]),c_0_63]) ).
cnf(c_0_68,plain,
gt(n5,n4),
inference(split_conjunct,[status(thm)],[gt_5_4]) ).
cnf(c_0_69,negated_conjecture,
( n5 = n3
| n5 = n4
| n4 = n3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_47]),c_0_34])]) ).
cnf(c_0_70,plain,
~ leq(plus(n1,X1),X1),
inference(spm,[status(thm)],[c_0_65,c_0_63]) ).
cnf(c_0_71,plain,
plus(n1,n3) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_53]),c_0_61]),c_0_62]),c_0_63]),c_0_67]),c_0_63]) ).
cnf(c_0_72,plain,
gt(n5,n3),
inference(split_conjunct,[status(thm)],[gt_5_3]) ).
cnf(c_0_73,negated_conjecture,
( n4 = n3
| n5 = n3 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_48]) ).
fof(c_0_74,plain,
! [X34] : leq(X34,X34),
inference(variable_rename,[status(thm)],[reflexivity_leq]) ).
cnf(c_0_75,plain,
~ leq(n4,n3),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_76,negated_conjecture,
n4 = n3,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_48]) ).
cnf(c_0_77,plain,
leq(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_78,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76]),c_0_77])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV104+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/5.47 % Computer : n009.cluster.edu
% 0.19/5.47 % Model : x86_64 x86_64
% 0.19/5.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.47 % Memory : 8046.5625MB
% 0.19/5.47 % OS : Linux 6.8.0-71-generic
% 0.19/5.48 % CPULimit : 300
% 0.19/5.48 % WCLimit : 300
% 0.19/5.48 % DateTime : Mon Sep 21 08:31:04 UTC 2026
% 0.19/5.48 % CPUTime :
% 0.19/5.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/5.55 Running first-order theorem proving
% 0.24/5.55 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/5.71 % Version: 3.5.1
% 0.24/5.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.71 % Starting new_bool_3 with 300s (1) cores
% 0.24/5.71 % Starting new_bool_1 with 300s (1) cores
% 0.24/5.71 % Starting sh5l with 300s (1) cores
% 0.24/5.71 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1324129 completed with status 0
% 0.24/5.71 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.24/5.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/5.71 % No SInE strategy applied
% 0.24/5.71 % Search class: FGHSM-FSLM33-DFFFFFNN
% 0.24/5.71 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/5.71 % Starting SubtermCWHack with 136s (1) cores
% 0.24/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/5.71 % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/5.71 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.24/5.71 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.24/5.71 % G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with pid 1324140 completed with status 0
% 0.24/5.71 % Result found by G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I
% 0.24/5.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/5.71 % No SInE strategy applied
% 0.24/5.71 % Search class: FGHSM-FSLM33-DFFFFFNN
% 0.24/5.71 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/5.71 % Starting SubtermCWHack with 136s (1) cores
% 0.24/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/5.71 % Starting U----_206b_01_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/5.71 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.24/5.71 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.24/5.71 % Preprocessing time : 0.007 s
% 0.24/5.71 % Presaturation interreduction done
% 0.24/5.71
% 0.24/5.71 % Proof found!
% 0.24/5.71 % SZS status Theorem
% 0.24/5.71 % SZS output start CNFRefutation
% See solution above
% 0.24/5.71 % Parsed axioms : 85
% 0.24/5.71 % Removed by relevancy pruning/SinE : 0
% 0.24/5.71 % Initial clauses : 199
% 0.24/5.71 % Removed in clause preprocessing : 2
% 0.24/5.71 % Initial clauses in saturation : 197
% 0.24/5.71 % Processed clauses : 612
% 0.24/5.71 % ...of these trivial : 18
% 0.24/5.71 % ...subsumed : 203
% 0.24/5.71 % ...remaining for further processing : 391
% 0.24/5.71 % Other redundant clauses eliminated : 3
% 0.24/5.71 % Clauses deleted for lack of memory : 0
% 0.24/5.71 % Backward-subsumed : 1
% 0.24/5.71 % Backward-rewritten : 57
% 0.24/5.71 % Generated clauses : 703
% 0.24/5.71 % ...of the previous two non-redundant : 653
% 0.24/5.71 % ...aggressively subsumed : 0
% 0.24/5.71 % Contextual simplify-reflections : 0
% 0.24/5.71 % Paramodulations : 698
% 0.24/5.71 % Factorizations : 3
% 0.24/5.71 % NegExts : 0
% 0.24/5.71 % Equation resolutions : 3
% 0.24/5.71 % Disequality decompositions : 0
% 0.24/5.71 % Total rewrite steps : 924
% 0.24/5.71 % ...of those cached : 809
% 0.24/5.71 % Propositional unsat checks : 0
% 0.24/5.71 % Propositional check models : 0
% 0.24/5.71 % Propositional check unsatisfiable : 0
% 0.24/5.71 % Propositional clauses : 0
% 0.24/5.71 % Propositional clauses after purity: 0
% 0.24/5.71 % Propositional unsat core size : 0
% 0.24/5.71 % Propositional preprocessing time : 0.000
% 0.24/5.71 % Propositional encoding time : 0.000
% 0.24/5.71 % Propositional solver time : 0.000
% 0.24/5.71 % Success case prop preproc time : 0.000
% 0.24/5.71 % Success case prop encoding time : 0.000
% 0.24/5.71 % Success case prop solver time : 0.000
% 0.24/5.71 % Current number of processed clauses : 134
% 0.24/5.71 % Positive orientable unit clauses : 64
% 0.24/5.71 % Positive unorientable unit clauses: 4
% 0.24/5.71 % Negative unit clauses : 38
% 0.24/5.71 % Non-unit-clauses : 28
% 0.24/5.71 % Current number of unprocessed clauses: 418
% 0.24/5.71 % ...number of literals in the above : 1314
% 0.24/5.71 % Current number of archived formulas : 0
% 0.24/5.71 % Current number of archived clauses : 257
% 0.24/5.71 % Clause-clause subsumption calls (NU) : 16796
% 0.24/5.71 % Rec. Clause-clause subsumption calls : 1591
% 0.24/5.71 % Non-unit clause-clause subsumptions : 1
% 0.24/5.71 % Unit Clause-clause subsumption calls : 691
% 0.24/5.71 % Rewrite failures with RHS unbound : 0
% 0.24/5.71 % BW rewrite match attempts : 55
% 0.24/5.71 % BW rewrite match successes : 49
% 0.24/5.71 % Condensation attempts : 0
% 0.24/5.71 % Condensation successes : 0
% 0.24/5.71 % Termbank termtop insertions : 24175
% 0.24/5.71 % Search garbage collected termcells : 2206
% 0.24/5.71
% 0.24/5.71 % -------------------------------------------------
% 0.24/5.71 % User time : 0.082 s
% 0.24/5.71 % System time : 0.008 s
% 0.24/5.71 % Total time : 0.090 s
% 0.24/5.71 % Maximum resident set size: 4252 pages
% 0.24/5.71
% 0.24/5.71 % -------------------------------------------------
% 0.24/5.71 % User time : 0.254 s
% 0.24/5.71 % System time : 0.044 s
% 0.24/5.71 % Total time : 0.298 s
% 0.24/5.71 % Maximum resident set size: 4608 pages
% 0.24/5.71 % E exiting
%------------------------------------------------------------------------------