TSTP Solution File: GEO285+1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : GEO285+1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 06:08:20 EDT 2024
% Result : Theorem 8.81s 1.64s
% Output : CNFRefutation 8.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 54 ( 21 unt; 0 def)
% Number of atoms : 215 ( 69 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 274 ( 113 ~; 97 |; 57 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 92 ( 0 sgn 40 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof('and(and(and(and(holds(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1133, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1132, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(242))))), 1131, 0), and(pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 2), pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 1))))), and(pred(conjunct1(conjunct2(conjunct2(242))), 2), pred(conjunct1(conjunct2(conjunct2(242))), 1))), and(pred(conjunct1(conjunct2(242)), 2), pred(conjunct1(conjunct2(242)), 1))), and(pred(conjunct1(242), 2), pred(conjunct1(242), 1)))',axiom,
( rless(vf(vd1127,vd1129),vf(vd1123,vd1125))
& vd1127 != vd1129
& vd1123 != vd1125
& vd1129 = vd1130
& rpoint(vd1130)
& vd1127 = vd1128
& rpoint(vd1128)
& vd1125 = vd1126
& rpoint(vd1126)
& vd1123 = vd1124
& rpoint(vd1124) ),
file('/export/starexec/sandbox2/tmp/tmp.YCkihl4Ki0/E---3.1_6039.p','and(and(and(and(holds(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1133, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1132, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(242))))), 1131, 0), and(pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 2), pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 1))))), and(pred(conjunct1(conjunct2(conjunct2(242))), 2), pred(conjunct1(conjunct2(conjunct2(242))), 1))), and(pred(conjunct1(conjunct2(242)), 2), pred(conjunct1(conjunct2(242)), 1))), and(pred(conjunct1(242), 2), pred(conjunct1(242), 1)))') ).
fof('qu(cond(axiom(149), 0), imp(cond(axiom(149), 0)))',axiom,
! [X65,X66] :
( ( X65 = X66
& rreal(X66) )
=> ~ rless(X65,X65) ),
file('/export/starexec/sandbox2/tmp/tmp.YCkihl4Ki0/E---3.1_6039.p','qu(cond(axiom(149), 0), imp(cond(axiom(149), 0)))') ).
fof('qu(cond(axiom(151), 0), imp(cond(axiom(151), 0)))',axiom,
! [X251,X252,X253,X254,X255,X256] :
( ( rless(X253,X255)
& rless(X251,X253)
& X255 = X256
& rreal(X256)
& X253 = X254
& rreal(X254)
& X251 = X252
& rreal(X252) )
=> rless(X251,X255) ),
file('/export/starexec/sandbox2/tmp/tmp.YCkihl4Ki0/E---3.1_6039.p','qu(cond(axiom(151), 0), imp(cond(axiom(151), 0)))') ).
fof('holds(258, 1150, 0)',axiom,
vd1123 = vd1129,
file('/export/starexec/sandbox2/tmp/tmp.YCkihl4Ki0/E---3.1_6039.p','holds(258, 1150, 0)') ).
fof('qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))',axiom,
! [X670,X671] :
( ( ? [X672] :
( X671 = X672
& rpoint(X672) )
& ? [X673] :
( X670 = X673
& rpoint(X673) ) )
=> vf(X670,X671) = vf(X671,X670) ),
file('/export/starexec/sandbox2/tmp/tmp.YCkihl4Ki0/E---3.1_6039.p','qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))') ).
fof('qu(cond(axiom(186), 0), imp(cond(axiom(186), 0)))',axiom,
! [X15,X16,X17,X18] :
( ( ron(X16,X18)
& rcenter(X17,X18)
& ? [X19] :
( X16 = X19
& rpoint(X19) )
& ? [X20] :
( X15 = X20
& rpoint(X20) ) )
=> ( rless(vf(X17,X15),vf(X17,X16))
<=> rinside(X15,X18) ) ),
file('/export/starexec/sandbox2/tmp/tmp.YCkihl4Ki0/E---3.1_6039.p','qu(cond(axiom(186), 0), imp(cond(axiom(186), 0)))') ).
fof('qu(cond(axiom(160), 0), imp(cond(axiom(160), 0)))',axiom,
! [X60,X61] :
( ( ? [X62] :
( X61 = X62
& rpoint(X62) )
& ? [X63] :
( X60 = X63
& rpoint(X63) ) )
=> ? [X64] :
( vf(X60,X61) = X64
& rreal(X64) ) ),
file('/export/starexec/sandbox2/tmp/tmp.YCkihl4Ki0/E---3.1_6039.p','qu(cond(axiom(160), 0), imp(cond(axiom(160), 0)))') ).
fof('and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct2(comma_conjunct2(259)), 0), pred(comma_conjunct1(comma_conjunct2(259)), 0)))), pred(comma_conjunct1(259), 0))',axiom,
( ron(vd1127,vd1152)
& rcenter(vd1123,vd1152)
& rcircle(vd1152)
& ron(vd1125,vd1151)
& ron(vd1123,vd1151) ),
file('/export/starexec/sandbox2/tmp/tmp.YCkihl4Ki0/E---3.1_6039.p','and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct2(comma_conjunct2(259)), 0), pred(comma_conjunct1(comma_conjunct2(259)), 0)))), pred(comma_conjunct1(259), 0))') ).
fof('neg(neg(260))',conjecture,
~ rinside(vd1125,vd1152),
file('/export/starexec/sandbox2/tmp/tmp.YCkihl4Ki0/E---3.1_6039.p','neg(neg(260))') ).
fof(c_0_9,plain,
( rless(vf(vd1127,vd1129),vf(vd1123,vd1125))
& vd1127 != vd1129
& vd1123 != vd1125
& vd1129 = vd1130
& rpoint(vd1130)
& vd1127 = vd1128
& rpoint(vd1128)
& vd1125 = vd1126
& rpoint(vd1126)
& vd1123 = vd1124
& rpoint(vd1124) ),
inference(fof_simplification,[status(thm)],['and(and(and(and(holds(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1133, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(conjunct2(242)))))), 1132, 0), and(holds(conjunct1(conjunct2(conjunct2(conjunct2(conjunct2(242))))), 1131, 0), and(pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 2), pred(conjunct1(conjunct2(conjunct2(conjunct2(242)))), 1))))), and(pred(conjunct1(conjunct2(conjunct2(242))), 2), pred(conjunct1(conjunct2(conjunct2(242))), 1))), and(pred(conjunct1(conjunct2(242)), 2), pred(conjunct1(conjunct2(242)), 1))), and(pred(conjunct1(242), 2), pred(conjunct1(242), 1)))']) ).
fof(c_0_10,plain,
! [X65,X66] :
( ( X65 = X66
& rreal(X66) )
=> ~ rless(X65,X65) ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(149), 0), imp(cond(axiom(149), 0)))']) ).
fof(c_0_11,plain,
! [X1001,X1002,X1003,X1004,X1005,X1006] :
( ~ rless(X1003,X1005)
| ~ rless(X1001,X1003)
| X1005 != X1006
| ~ rreal(X1006)
| X1003 != X1004
| ~ rreal(X1004)
| X1001 != X1002
| ~ rreal(X1002)
| rless(X1001,X1005) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(151), 0), imp(cond(axiom(151), 0)))'])])]) ).
fof(c_0_12,plain,
( rless(vf(vd1127,vd1129),vf(vd1123,vd1125))
& vd1127 != vd1129
& vd1123 != vd1125
& vd1129 = vd1130
& rpoint(vd1130)
& vd1127 = vd1128
& rpoint(vd1128)
& vd1125 = vd1126
& rpoint(vd1126)
& vd1123 = vd1124
& rpoint(vd1124) ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X801,X802] :
( X801 != X802
| ~ rreal(X802)
| ~ rless(X801,X801) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_14,plain,
( rless(X3,X2)
| ~ rless(X1,X2)
| ~ rless(X3,X1)
| X2 != X4
| ~ rreal(X4)
| X1 != X5
| ~ rreal(X5)
| X3 != X6
| ~ rreal(X6) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
rless(vf(vd1127,vd1129),vf(vd1123,vd1125)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
vd1123 = vd1129,
inference(split_conjunct,[status(thm)],['holds(258, 1150, 0)']) ).
cnf(c_0_17,plain,
( X1 != X2
| ~ rreal(X2)
| ~ rless(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( rless(X1,X2)
| ~ rreal(X1)
| ~ rreal(X3)
| ~ rreal(X2)
| ~ rless(X1,X3)
| ~ rless(X3,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_14])])]) ).
cnf(c_0_19,plain,
rless(vf(vd1127,vd1123),vf(vd1123,vd1125)),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,plain,
! [X1420,X1421,X1422,X1423] :
( X1421 != X1422
| ~ rpoint(X1422)
| X1420 != X1423
| ~ rpoint(X1423)
| vf(X1420,X1421) = vf(X1421,X1420) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))'])])])]) ).
cnf(c_0_21,plain,
vd1129 = vd1130,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_22,plain,
! [X751,X752,X753,X754,X755,X756] :
( ( ~ rless(vf(X753,X751),vf(X753,X752))
| rinside(X751,X754)
| ~ ron(X752,X754)
| ~ rcenter(X753,X754)
| X752 != X755
| ~ rpoint(X755)
| X751 != X756
| ~ rpoint(X756) )
& ( ~ rinside(X751,X754)
| rless(vf(X753,X751),vf(X753,X752))
| ~ ron(X752,X754)
| ~ rcenter(X753,X754)
| X752 != X755
| ~ rpoint(X755)
| X751 != X756
| ~ rpoint(X756) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(186), 0), imp(cond(axiom(186), 0)))'])])])])]) ).
cnf(c_0_23,plain,
( ~ rreal(X1)
| ~ rless(X1,X1) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( rless(vf(vd1127,vd1123),X1)
| ~ rreal(vf(vd1127,vd1123))
| ~ rreal(vf(vd1123,vd1125))
| ~ rreal(X1)
| ~ rless(vf(vd1123,vd1125),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( vf(X3,X1) = vf(X1,X3)
| X1 != X2
| ~ rpoint(X2)
| X3 != X4
| ~ rpoint(X4) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
rpoint(vd1130),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,plain,
vd1130 = vd1123,
inference(rw,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_28,plain,
rpoint(vd1128),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,plain,
vd1127 = vd1128,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,plain,
( rless(vf(X3,X1),vf(X3,X4))
| ~ rinside(X1,X2)
| ~ ron(X4,X2)
| ~ rcenter(X3,X2)
| X4 != X5
| ~ rpoint(X5)
| X1 != X6
| ~ rpoint(X6) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_31,plain,
! [X796,X797,X798,X799] :
( ( vf(X796,X797) = esk8_2(X796,X797)
| X797 != X798
| ~ rpoint(X798)
| X796 != X799
| ~ rpoint(X799) )
& ( rreal(esk8_2(X796,X797))
| X797 != X798
| ~ rpoint(X798)
| X796 != X799
| ~ rpoint(X799) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(160), 0), imp(cond(axiom(160), 0)))'])])])])])]) ).
cnf(c_0_32,plain,
( ~ rreal(vf(vd1127,vd1123))
| ~ rreal(vf(vd1123,vd1125))
| ~ rless(vf(vd1123,vd1125),vf(vd1127,vd1123)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,plain,
( vf(X1,X2) = vf(X2,X1)
| ~ rpoint(X2)
| ~ rpoint(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_25])]) ).
cnf(c_0_34,plain,
rpoint(vd1123),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
rpoint(vd1127),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
( rless(vf(X1,X2),vf(X1,X3))
| ~ rpoint(X2)
| ~ rpoint(X3)
| ~ rcenter(X1,X4)
| ~ ron(X3,X4)
| ~ rinside(X2,X4) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_30])]) ).
cnf(c_0_37,plain,
rcenter(vd1123,vd1152),
inference(split_conjunct,[status(thm)],['and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct2(comma_conjunct2(259)), 0), pred(comma_conjunct1(comma_conjunct2(259)), 0)))), pred(comma_conjunct1(259), 0))']) ).
cnf(c_0_38,plain,
rpoint(vd1126),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,plain,
vd1125 = vd1126,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_40,negated_conjecture,
rinside(vd1125,vd1152),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['neg(neg(260))'])]) ).
cnf(c_0_41,plain,
( rreal(esk8_2(X1,X2))
| X2 != X3
| ~ rpoint(X3)
| X1 != X4
| ~ rpoint(X4) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,plain,
( vf(X1,X2) = esk8_2(X1,X2)
| X2 != X3
| ~ rpoint(X3)
| X1 != X4
| ~ rpoint(X4) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,plain,
( ~ rreal(vf(vd1123,vd1127))
| ~ rreal(vf(vd1123,vd1125))
| ~ rless(vf(vd1123,vd1125),vf(vd1123,vd1127)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_44,plain,
( rless(vf(vd1123,X1),vf(vd1123,X2))
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ ron(X2,vd1152)
| ~ rinside(X1,vd1152) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,plain,
rpoint(vd1125),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,plain,
ron(vd1127,vd1152),
inference(split_conjunct,[status(thm)],['and(and(pred(comma_conjunct2(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct1(comma_conjunct2(comma_conjunct2(259))), 0), and(pred(comma_conjunct2(comma_conjunct2(259)), 0), pred(comma_conjunct1(comma_conjunct2(259)), 0)))), pred(comma_conjunct1(259), 0))']) ).
cnf(c_0_47,negated_conjecture,
rinside(vd1125,vd1152),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,plain,
( rreal(esk8_2(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_41])]) ).
cnf(c_0_49,plain,
( esk8_2(X1,X2) = vf(X1,X2)
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_42])]) ).
cnf(c_0_50,plain,
( ~ rreal(vf(vd1123,vd1127))
| ~ rreal(vf(vd1123,vd1125)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_35]),c_0_46]),c_0_47])]) ).
cnf(c_0_51,plain,
( rreal(vf(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,plain,
~ rreal(vf(vd1123,vd1127)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_34]),c_0_45])]) ).
cnf(c_0_53,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_51]),c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GEO285+1 : TPTP v8.2.0. Released v4.1.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n019.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri Jun 21 09:42:54 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.19/0.51 Running first-order theorem proving
% 0.19/0.51 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.YCkihl4Ki0/E---3.1_6039.p
% 8.81/1.64 # Version: 3.2.0
% 8.81/1.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.81/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.81/1.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.81/1.64 # Starting new_bool_3 with 300s (1) cores
% 8.81/1.64 # Starting new_bool_1 with 300s (1) cores
% 8.81/1.64 # Starting sh5l with 300s (1) cores
% 8.81/1.64 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 6118 completed with status 0
% 8.81/1.64 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 8.81/1.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.81/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.81/1.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.81/1.64 # No SInE strategy applied
% 8.81/1.64 # Search class: FGHSF-FSLM33-SFFFFFNN
% 8.81/1.64 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 8.81/1.64 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 8.81/1.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 8.81/1.64 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 8.81/1.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 8.81/1.64 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 8.81/1.64 # H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with pid 6126 completed with status 0
% 8.81/1.64 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y
% 8.81/1.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 8.81/1.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.81/1.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.81/1.64 # No SInE strategy applied
% 8.81/1.64 # Search class: FGHSF-FSLM33-SFFFFFNN
% 8.81/1.64 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 8.81/1.64 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 8.81/1.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 8.81/1.64 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 8.81/1.64 # Preprocessing time : 0.014 s
% 8.81/1.64 # Presaturation interreduction done
% 8.81/1.64
% 8.81/1.64 # Proof found!
% 8.81/1.64 # SZS status Theorem
% 8.81/1.64 # SZS output start CNFRefutation
% See solution above
% 8.81/1.64 # Parsed axioms : 133
% 8.81/1.64 # Removed by relevancy pruning/SinE : 0
% 8.81/1.64 # Initial clauses : 301
% 8.81/1.64 # Removed in clause preprocessing : 2
% 8.81/1.64 # Initial clauses in saturation : 299
% 8.81/1.64 # Processed clauses : 1602
% 8.81/1.64 # ...of these trivial : 18
% 8.81/1.64 # ...subsumed : 565
% 8.81/1.64 # ...remaining for further processing : 1019
% 8.81/1.64 # Other redundant clauses eliminated : 1100
% 8.81/1.64 # Clauses deleted for lack of memory : 0
% 8.81/1.64 # Backward-subsumed : 32
% 8.81/1.64 # Backward-rewritten : 10
% 8.81/1.64 # Generated clauses : 3129
% 8.81/1.64 # ...of the previous two non-redundant : 3051
% 8.81/1.64 # ...aggressively subsumed : 0
% 8.81/1.64 # Contextual simplify-reflections : 54
% 8.81/1.64 # Paramodulations : 2873
% 8.81/1.64 # Factorizations : 0
% 8.81/1.64 # NegExts : 0
% 8.81/1.64 # Equation resolutions : 1119
% 8.81/1.64 # Disequality decompositions : 0
% 8.81/1.64 # Total rewrite steps : 924
% 8.81/1.64 # ...of those cached : 905
% 8.81/1.64 # Propositional unsat checks : 0
% 8.81/1.64 # Propositional check models : 0
% 8.81/1.64 # Propositional check unsatisfiable : 0
% 8.81/1.64 # Propositional clauses : 0
% 8.81/1.64 # Propositional clauses after purity: 0
% 8.81/1.64 # Propositional unsat core size : 0
% 8.81/1.64 # Propositional preprocessing time : 0.000
% 8.81/1.64 # Propositional encoding time : 0.000
% 8.81/1.64 # Propositional solver time : 0.000
% 8.81/1.64 # Success case prop preproc time : 0.000
% 8.81/1.64 # Success case prop encoding time : 0.000
% 8.81/1.64 # Success case prop solver time : 0.000
% 8.81/1.64 # Current number of processed clauses : 473
% 8.81/1.64 # Positive orientable unit clauses : 24
% 8.81/1.64 # Positive unorientable unit clauses: 0
% 8.81/1.64 # Negative unit clauses : 10
% 8.81/1.64 # Non-unit-clauses : 439
% 8.81/1.64 # Current number of unprocessed clauses: 1909
% 8.81/1.64 # ...number of literals in the above : 26450
% 8.81/1.64 # Current number of archived formulas : 0
% 8.81/1.64 # Current number of archived clauses : 309
% 8.81/1.64 # Clause-clause subsumption calls (NU) : 246015
% 8.81/1.64 # Rec. Clause-clause subsumption calls : 12365
% 8.81/1.64 # Non-unit clause-clause subsumptions : 582
% 8.81/1.64 # Unit Clause-clause subsumption calls : 1704
% 8.81/1.64 # Rewrite failures with RHS unbound : 0
% 8.81/1.64 # BW rewrite match attempts : 4
% 8.81/1.64 # BW rewrite match successes : 4
% 8.81/1.64 # Condensation attempts : 0
% 8.81/1.64 # Condensation successes : 0
% 8.81/1.64 # Termbank termtop insertions : 143584
% 8.81/1.64 # Search garbage collected termcells : 14038
% 8.81/1.64
% 8.81/1.64 # -------------------------------------------------
% 8.81/1.64 # User time : 1.092 s
% 8.81/1.64 # System time : 0.009 s
% 8.81/1.64 # Total time : 1.101 s
% 8.81/1.64 # Maximum resident set size: 4400 pages
% 8.81/1.64
% 8.81/1.64 # -------------------------------------------------
% 8.81/1.64 # User time : 5.280 s
% 8.81/1.64 # System time : 0.033 s
% 8.81/1.64 # Total time : 5.313 s
% 8.81/1.64 # Maximum resident set size: 2548 pages
% 8.81/1.64 % E---3.1 exiting
% 8.81/1.64 % E exiting
%------------------------------------------------------------------------------