TSTP Solution File: SWV055+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV055+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:55:57 EDT 2023
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 69 ( 38 unt; 0 def)
% Number of atoms : 178 ( 50 equ)
% Maximal formula atoms : 41 ( 2 avg)
% Number of connectives : 173 ( 64 ~; 70 |; 28 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 3 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 25 ( 25 usr; 16 con; 0-3 aty)
% Number of variables : 46 ( 2 sgn; 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(successor_2,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox2/tmp/tmp.nWzp0CBdBM/E---3.1_989.p',successor_2) ).
fof(successor_1,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox2/tmp/tmp.nWzp0CBdBM/E---3.1_989.p',successor_1) ).
fof(successor_3,axiom,
succ(succ(succ(n0))) = n3,
file('/export/starexec/sandbox2/tmp/tmp.nWzp0CBdBM/E---3.1_989.p',successor_3) ).
fof(cl5_nebula_norm_0037,conjecture,
( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X14,X18] :
( ( leq(n0,X14)
& leq(X14,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X14,X18)) = n1 ) )
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X4,X20] :
( ( leq(n0,X4)
& leq(X4,minus(n0,n1)) )
=> a_select3(q,pv10,X4) = divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X20,n0),a_select2(x,pv10)),minus(a_select3(center,X20,n0),a_select2(x,pv10)))))) )
& ! [X21,X22] :
( ( leq(n0,X21)
& leq(X21,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X21,X22)) = n1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.nWzp0CBdBM/E---3.1_989.p',cl5_nebula_norm_0037) ).
fof(pred_succ,axiom,
! [X1] : pred(succ(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.nWzp0CBdBM/E---3.1_989.p',pred_succ) ).
fof(pred_minus_1,axiom,
! [X1] : minus(X1,n1) = pred(X1),
file('/export/starexec/sandbox2/tmp/tmp.nWzp0CBdBM/E---3.1_989.p',pred_minus_1) ).
fof(successor_4,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/export/starexec/sandbox2/tmp/tmp.nWzp0CBdBM/E---3.1_989.p',successor_4) ).
fof(successor_5,axiom,
succ(succ(succ(succ(succ(n0))))) = n5,
file('/export/starexec/sandbox2/tmp/tmp.nWzp0CBdBM/E---3.1_989.p',successor_5) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/tmp/tmp.nWzp0CBdBM/E---3.1_989.p',succ_tptp_minus_1) ).
fof(leq_succ,axiom,
! [X1,X2] :
( leq(X1,X2)
=> leq(X1,succ(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.nWzp0CBdBM/E---3.1_989.p',leq_succ) ).
fof(irreflexivity_gt,axiom,
! [X1] : ~ gt(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.nWzp0CBdBM/E---3.1_989.p',irreflexivity_gt) ).
fof(leq_succ_gt,axiom,
! [X1,X2] :
( leq(succ(X1),X2)
=> gt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.nWzp0CBdBM/E---3.1_989.p',leq_succ_gt) ).
fof(finite_domain_0,axiom,
! [X1] :
( ( leq(n0,X1)
& leq(X1,n0) )
=> X1 = n0 ),
file('/export/starexec/sandbox2/tmp/tmp.nWzp0CBdBM/E---3.1_989.p',finite_domain_0) ).
cnf(c_0_13,plain,
succ(succ(n0)) = n2,
inference(split_conjunct,[status(thm)],[successor_2]) ).
cnf(c_0_14,plain,
succ(n0) = n1,
inference(split_conjunct,[status(thm)],[successor_1]) ).
cnf(c_0_15,plain,
succ(succ(succ(n0))) = n3,
inference(split_conjunct,[status(thm)],[successor_3]) ).
cnf(c_0_16,plain,
succ(n1) = n2,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_17,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X14,X18] :
( ( leq(n0,X14)
& leq(X14,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X14,X18)) = n1 ) )
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ! [X4,X20] :
( ( leq(n0,X4)
& leq(X4,minus(n0,n1)) )
=> a_select3(q,pv10,X4) = divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,X20,n0),a_select2(x,pv10)),minus(a_select3(center,X20,n0),a_select2(x,pv10)))))) )
& ! [X21,X22] :
( ( leq(n0,X21)
& leq(X21,minus(pv10,n1)) )
=> sum(n0,minus(n5,n1),a_select3(q,X21,X22)) = n1 ) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0037]) ).
fof(c_0_18,plain,
! [X77] : pred(succ(X77)) = X77,
inference(variable_rename,[status(thm)],[pred_succ]) ).
fof(c_0_19,plain,
! [X40] : minus(X40,n1) = pred(X40),
inference(variable_rename,[status(thm)],[pred_minus_1]) ).
cnf(c_0_20,plain,
succ(succ(succ(succ(n0)))) = n4,
inference(split_conjunct,[status(thm)],[successor_4]) ).
cnf(c_0_21,plain,
succ(n2) = n3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_14]),c_0_16]) ).
fof(c_0_22,negated_conjecture,
! [X28,X29] :
( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ( ~ leq(n0,X28)
| ~ leq(X28,minus(pv10,n1))
| sum(n0,minus(n5,n1),a_select3(q,X28,X29)) = n1 )
& ( leq(n0,esk3_0)
| leq(n0,esk1_0)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(esk3_0,minus(pv10,n1))
| leq(n0,esk1_0)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1
| leq(n0,esk1_0)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(n0,esk3_0)
| leq(esk1_0,minus(n0,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(esk3_0,minus(pv10,n1))
| leq(esk1_0,minus(n0,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1
| leq(esk1_0,minus(n0,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(n0,esk3_0)
| a_select3(q,pv10,esk1_0) != divide(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk2_0,n0),a_select2(x,pv10))))))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( leq(esk3_0,minus(pv10,n1))
| a_select3(q,pv10,esk1_0) != divide(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk2_0,n0),a_select2(x,pv10))))))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) )
& ( sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1
| a_select3(q,pv10,esk1_0) != divide(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),sum(n0,minus(n5,n1),sqrt(times(minus(a_select3(center,esk2_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk2_0,n0),a_select2(x,pv10))))))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])]) ).
cnf(c_0_23,plain,
pred(succ(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
minus(X1,n1) = pred(X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
succ(succ(succ(succ(succ(n0))))) = n5,
inference(split_conjunct,[status(thm)],[successor_5]) ).
cnf(c_0_26,plain,
succ(n3) = n4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_14]),c_0_16]),c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( leq(esk1_0,minus(n0,n1))
| sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
leq(n0,pv10),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
leq(pv10,minus(n135300,n1)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
minus(succ(X1),n1) = X1,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
succ(n4) = n5,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_14]),c_0_16]),c_0_21]),c_0_26]) ).
cnf(c_0_32,plain,
succ(tptp_minus_1) = n0,
inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).
cnf(c_0_33,negated_conjecture,
( leq(n0,esk3_0)
| leq(esk1_0,minus(n0,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,negated_conjecture,
( leq(esk3_0,minus(pv10,n1))
| leq(esk1_0,minus(n0,n1))
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_35,plain,
! [X54,X55] :
( ~ leq(X54,X55)
| leq(X54,succ(X55)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ])]) ).
cnf(c_0_36,negated_conjecture,
( leq(esk1_0,minus(n0,n1))
| sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_37,plain,
minus(n5,n1) = n4,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
minus(n0,n1) = tptp_minus_1,
inference(spm,[status(thm)],[c_0_30,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( sum(n0,minus(n5,n1),a_select3(q,X1,X2)) = n1
| ~ leq(n0,X1)
| ~ leq(X1,minus(pv10,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_40,negated_conjecture,
( leq(esk1_0,minus(n0,n1))
| leq(n0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_28]),c_0_29])]) ).
cnf(c_0_41,negated_conjecture,
( leq(esk3_0,minus(pv10,n1))
| leq(esk1_0,minus(n0,n1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_28]),c_0_29])]) ).
cnf(c_0_42,negated_conjecture,
( leq(n0,esk1_0)
| sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_43,plain,
! [X1] : ~ gt(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_gt]) ).
cnf(c_0_44,plain,
( leq(X1,succ(X2))
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,negated_conjecture,
( leq(esk1_0,tptp_minus_1)
| sum(n0,n4,a_select3(q,esk3_0,esk4_0)) != n1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( sum(n0,n4,a_select3(q,X1,X2)) = n1
| ~ leq(X1,minus(pv10,n1))
| ~ leq(n0,X1) ),
inference(rw,[status(thm)],[c_0_39,c_0_37]) ).
cnf(c_0_47,negated_conjecture,
( leq(n0,esk3_0)
| leq(esk1_0,tptp_minus_1) ),
inference(rw,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_48,negated_conjecture,
( leq(esk3_0,minus(pv10,n1))
| leq(esk1_0,tptp_minus_1) ),
inference(rw,[status(thm)],[c_0_41,c_0_38]) ).
cnf(c_0_49,negated_conjecture,
( leq(n0,esk1_0)
| sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_28]),c_0_29])]) ).
cnf(c_0_50,negated_conjecture,
( leq(n0,esk3_0)
| leq(n0,esk1_0)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_51,negated_conjecture,
( leq(esk3_0,minus(pv10,n1))
| leq(n0,esk1_0)
| ~ leq(n0,pv10)
| ~ leq(pv10,minus(n135300,n1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_52,plain,
! [X67] : ~ gt(X67,X67),
inference(variable_rename,[status(thm)],[c_0_43]) ).
fof(c_0_53,plain,
! [X60,X61] :
( ~ leq(succ(X60),X61)
| gt(X61,X60) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt])]) ).
fof(c_0_54,plain,
! [X45] :
( ~ leq(n0,X45)
| ~ leq(X45,n0)
| X45 = n0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])]) ).
cnf(c_0_55,plain,
( leq(X1,n0)
| ~ leq(X1,tptp_minus_1) ),
inference(spm,[status(thm)],[c_0_44,c_0_32]) ).
cnf(c_0_56,negated_conjecture,
leq(esk1_0,tptp_minus_1),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]) ).
cnf(c_0_57,negated_conjecture,
( leq(n0,esk1_0)
| sum(n0,n4,a_select3(q,esk3_0,esk4_0)) != n1 ),
inference(rw,[status(thm)],[c_0_49,c_0_37]) ).
cnf(c_0_58,negated_conjecture,
( leq(n0,esk3_0)
| leq(n0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_28]),c_0_29])]) ).
cnf(c_0_59,negated_conjecture,
( leq(esk3_0,minus(pv10,n1))
| leq(n0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_28]),c_0_29])]) ).
cnf(c_0_60,plain,
~ gt(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_61,plain,
( gt(X2,X1)
| ~ leq(succ(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_62,plain,
( X1 = n0
| ~ leq(n0,X1)
| ~ leq(X1,n0) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_63,negated_conjecture,
leq(esk1_0,n0),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_64,negated_conjecture,
leq(n0,esk1_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_46]),c_0_58]),c_0_59]) ).
cnf(c_0_65,plain,
~ leq(succ(X1),X1),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
esk1_0 = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_67,plain,
~ leq(n0,tptp_minus_1),
inference(spm,[status(thm)],[c_0_65,c_0_32]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_66]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWV055+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n002.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 04:08:00 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.nWzp0CBdBM/E---3.1_989.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # new_bool_3 with pid 1093 completed with status 0
% 0.17/0.46 # Result found by new_bool_3
% 0.17/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGHSM-FFMM31-DFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 100s (1) cores
% 0.17/0.46 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1096 completed with status 0
% 0.17/0.46 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGHSM-FFMM31-DFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 100s (1) cores
% 0.17/0.46 # Preprocessing time : 0.003 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 92
% 0.17/0.46 # Removed by relevancy pruning/SinE : 23
% 0.17/0.46 # Initial clauses : 83
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 83
% 0.17/0.46 # Processed clauses : 376
% 0.17/0.46 # ...of these trivial : 1
% 0.17/0.46 # ...subsumed : 101
% 0.17/0.46 # ...remaining for further processing : 274
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 2
% 0.17/0.46 # Backward-rewritten : 23
% 0.17/0.46 # Generated clauses : 414
% 0.17/0.46 # ...of the previous two non-redundant : 339
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 5
% 0.17/0.46 # Paramodulations : 414
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Total rewrite steps : 350
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 166
% 0.17/0.46 # Positive orientable unit clauses : 93
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 53
% 0.17/0.46 # Non-unit-clauses : 20
% 0.17/0.46 # Current number of unprocessed clauses: 129
% 0.17/0.46 # ...number of literals in the above : 262
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 108
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 305
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 220
% 0.17/0.46 # Non-unit clause-clause subsumptions : 5
% 0.17/0.46 # Unit Clause-clause subsumption calls : 507
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 18
% 0.17/0.46 # BW rewrite match successes : 9
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 7953
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.012 s
% 0.17/0.46 # System time : 0.008 s
% 0.17/0.46 # Total time : 0.020 s
% 0.17/0.46 # Maximum resident set size: 2060 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.015 s
% 0.17/0.46 # System time : 0.009 s
% 0.17/0.46 # Total time : 0.024 s
% 0.17/0.46 # Maximum resident set size: 1796 pages
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------