TSTP Solution File: GEO336+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO336+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 17:34:54 EDT 2023
% Result : Theorem 1.06s 0.95s
% Output : CNFRefutation 1.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 53 ( 21 unt; 0 def)
% Number of atoms : 265 ( 122 equ)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 362 ( 150 ~; 142 |; 64 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-8 aty)
% Number of variables : 133 ( 0 sgn; 67 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qe(s1(plural(386)))',axiom,
? [X184] :
( vd1361 = X184
& rpoint(X184) ),
file('/export/starexec/sandbox2/tmp/tmp.2fv9i4kWVJ/E---3.1_29467.p','qe(s1(plural(386)))') ).
fof('qe(s2(plural(386)))',axiom,
? [X24] :
( vd1362 = X24
& rpoint(X24) ),
file('/export/starexec/sandbox2/tmp/tmp.2fv9i4kWVJ/E---3.1_29467.p','qe(s2(plural(386)))') ).
fof('qe(s3(plural(386)))',axiom,
? [X183] :
( vd1363 = X183
& rpoint(X183) ),
file('/export/starexec/sandbox2/tmp/tmp.2fv9i4kWVJ/E---3.1_29467.p','qe(s3(plural(386)))') ).
fof('qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))',axiom,
! [X49,X50] :
( ( ? [X51] :
( X50 = X51
& rpoint(X51) )
& ? [X52] :
( X49 = X52
& rpoint(X52) ) )
=> vf(X49,X50) = vf(X50,X49) ),
file('/export/starexec/sandbox2/tmp/tmp.2fv9i4kWVJ/E---3.1_29467.p','qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))') ).
fof('qu(cond(axiom(81), 0), imp(cond(axiom(81), 0)))',axiom,
! [X87,X88,X89] :
( ( rR(X88,X87,X89)
& ? [X90] :
( X89 = X90
& rpoint(X90) )
& ? [X91] :
( X88 = X91
& rpoint(X91) )
& ? [X92] :
( X87 = X92
& rpoint(X92) ) )
=> ( ~ rR(X87,X88,X89)
& X87 != X89
& X87 != X88
& rR(X88,X89,X87) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2fv9i4kWVJ/E---3.1_29467.p','qu(cond(axiom(81), 0), imp(cond(axiom(81), 0)))') ).
fof('ass(cond(goal(238), 0), 1)',axiom,
! [X2,X3,X4,X5,X6,X7,X8,X9] :
( ( rless(vf(X6,X8),vf(X2,X4))
& X6 != X8
& X2 != X4
& X8 = X9
& rpoint(X9)
& X6 = X7
& rpoint(X7)
& X4 = X5
& rpoint(X5)
& X2 = X3
& rpoint(X3) )
=> rR(vskolem1120(X2,X3,X4,X5,X6,X7,X8,X9),X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.2fv9i4kWVJ/E---3.1_29467.p','ass(cond(goal(238), 0), 1)') ).
fof('holds(395, 1377, 0)',axiom,
rless(vf(vd1361,vd1362),vf(vd1361,vd1363)),
file('/export/starexec/sandbox2/tmp/tmp.2fv9i4kWVJ/E---3.1_29467.p','holds(395, 1377, 0)') ).
fof('ass(cond(goal(238), 0), 2)',axiom,
! [X2,X3,X4,X5,X6,X7,X8,X9] :
( ( rless(vf(X6,X8),vf(X2,X4))
& X6 != X8
& X2 != X4
& X8 = X9
& rpoint(X9)
& X6 = X7
& rpoint(X7)
& X4 = X5
& rpoint(X5)
& X2 = X3
& rpoint(X3) )
=> rpoint(vskolem1120(X2,X3,X4,X5,X6,X7,X8,X9)) ),
file('/export/starexec/sandbox2/tmp/tmp.2fv9i4kWVJ/E---3.1_29467.p','ass(cond(goal(238), 0), 2)') ).
fof('qe(396)',conjecture,
? [X1] :
( vf(vd1363,X1) = vf(vd1361,vd1362)
& rR(X1,vd1361,vd1363)
& rpoint(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.2fv9i4kWVJ/E---3.1_29467.p','qe(396)') ).
fof('pred(386, 7)',axiom,
vd1361 != vd1362,
file('/export/starexec/sandbox2/tmp/tmp.2fv9i4kWVJ/E---3.1_29467.p','pred(386, 7)') ).
fof('pred(386, 8)',axiom,
vd1361 != vd1363,
file('/export/starexec/sandbox2/tmp/tmp.2fv9i4kWVJ/E---3.1_29467.p','pred(386, 8)') ).
fof('ass(cond(goal(238), 0), 0)',axiom,
! [X2,X3,X4,X5,X6,X7,X8,X9] :
( ( rless(vf(X6,X8),vf(X2,X4))
& X6 != X8
& X2 != X4
& X8 = X9
& rpoint(X9)
& X6 = X7
& rpoint(X7)
& X4 = X5
& rpoint(X5)
& X2 = X3
& rpoint(X3) )
=> vf(X2,vskolem1120(X2,X3,X4,X5,X6,X7,X8,X9)) = vf(X6,X8) ),
file('/export/starexec/sandbox2/tmp/tmp.2fv9i4kWVJ/E---3.1_29467.p','ass(cond(goal(238), 0), 0)') ).
fof(c_0_12,plain,
( vd1361 = esk11_0
& rpoint(esk11_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s1(plural(386)))'])]) ).
fof(c_0_13,plain,
( vd1362 = esk1_0
& rpoint(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s2(plural(386)))'])]) ).
fof(c_0_14,plain,
( vd1363 = esk10_0
& rpoint(esk10_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s3(plural(386)))'])]) ).
fof(c_0_15,plain,
! [X836,X837,X838,X839] :
( X837 != X838
| ~ rpoint(X838)
| X836 != X839
| ~ rpoint(X839)
| vf(X836,X837) = vf(X837,X836) ),
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)))'])])]) ).
fof(c_0_16,plain,
! [X87,X88,X89] :
( ( rR(X88,X87,X89)
& ? [X90] :
( X89 = X90
& rpoint(X90) )
& ? [X91] :
( X88 = X91
& rpoint(X91) )
& ? [X92] :
( X87 = X92
& rpoint(X92) ) )
=> ( ~ rR(X87,X88,X89)
& X87 != X89
& X87 != X88
& rR(X88,X89,X87) ) ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(81), 0), imp(cond(axiom(81), 0)))']) ).
fof(c_0_17,plain,
! [X781,X782,X783,X784,X785,X786,X787,X788] :
( ~ rless(vf(X785,X787),vf(X781,X783))
| X785 = X787
| X781 = X783
| X787 != X788
| ~ rpoint(X788)
| X785 != X786
| ~ rpoint(X786)
| X783 != X784
| ~ rpoint(X784)
| X781 != X782
| ~ rpoint(X782)
| rR(vskolem1120(X781,X782,X783,X784,X785,X786,X787,X788),X781,X783) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(238), 0), 1)'])]) ).
cnf(c_0_18,plain,
rless(vf(vd1361,vd1362),vf(vd1361,vd1363)),
inference(split_conjunct,[status(thm)],['holds(395, 1377, 0)']) ).
cnf(c_0_19,plain,
vd1361 = esk11_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
vd1362 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
vd1363 = esk10_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( vf(X3,X1) = vf(X1,X3)
| X1 != X2
| ~ rpoint(X2)
| X3 != X4
| ~ rpoint(X4) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X789,X790,X791,X792,X793,X794,X795,X796] :
( ~ rless(vf(X793,X795),vf(X789,X791))
| X793 = X795
| X789 = X791
| X795 != X796
| ~ rpoint(X796)
| X793 != X794
| ~ rpoint(X794)
| X791 != X792
| ~ rpoint(X792)
| X789 != X790
| ~ rpoint(X790)
| rpoint(vskolem1120(X789,X790,X791,X792,X793,X794,X795,X796)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(238), 0), 2)'])]) ).
fof(c_0_24,negated_conjecture,
~ ? [X1] :
( vf(vd1363,X1) = vf(vd1361,vd1362)
& rR(X1,vd1361,vd1363)
& rpoint(X1) ),
inference(assume_negation,[status(cth)],['qe(396)']) ).
fof(c_0_25,plain,
! [X874,X875,X876,X877,X878,X879] :
( ( ~ rR(X874,X875,X876)
| ~ rR(X875,X874,X876)
| X876 != X877
| ~ rpoint(X877)
| X875 != X878
| ~ rpoint(X878)
| X874 != X879
| ~ rpoint(X879) )
& ( X874 != X876
| ~ rR(X875,X874,X876)
| X876 != X877
| ~ rpoint(X877)
| X875 != X878
| ~ rpoint(X878)
| X874 != X879
| ~ rpoint(X879) )
& ( X874 != X875
| ~ rR(X875,X874,X876)
| X876 != X877
| ~ rpoint(X877)
| X875 != X878
| ~ rpoint(X878)
| X874 != X879
| ~ rpoint(X879) )
& ( rR(X875,X876,X874)
| ~ rR(X875,X874,X876)
| X876 != X877
| ~ rpoint(X877)
| X875 != X878
| ~ rpoint(X878)
| X874 != X879
| ~ rpoint(X879) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_26,plain,
( X1 = X2
| X3 = X4
| rR(vskolem1120(X3,X8,X4,X7,X1,X6,X2,X5),X3,X4)
| ~ rless(vf(X1,X2),vf(X3,X4))
| X2 != X5
| ~ rpoint(X5)
| X1 != X6
| ~ rpoint(X6)
| X4 != X7
| ~ rpoint(X7)
| X3 != X8
| ~ rpoint(X8) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
rless(vf(esk11_0,esk1_0),vf(esk11_0,esk10_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_19]),c_0_21]) ).
cnf(c_0_28,plain,
( vf(X1,X2) = vf(X2,X1)
| ~ rpoint(X2)
| ~ rpoint(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_22])]) ).
cnf(c_0_29,plain,
rpoint(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,plain,
rpoint(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_31,plain,
vd1361 != vd1362,
inference(split_conjunct,[status(thm)],['pred(386, 7)']) ).
cnf(c_0_32,plain,
vd1361 != vd1363,
inference(split_conjunct,[status(thm)],['pred(386, 8)']) ).
cnf(c_0_33,plain,
( X1 = X2
| X3 = X4
| rpoint(vskolem1120(X3,X8,X4,X7,X1,X6,X2,X5))
| ~ rless(vf(X1,X2),vf(X3,X4))
| X2 != X5
| ~ rpoint(X5)
| X1 != X6
| ~ rpoint(X6)
| X4 != X7
| ~ rpoint(X7)
| X3 != X8
| ~ rpoint(X8) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_34,negated_conjecture,
! [X772] :
( vf(vd1363,X772) != vf(vd1361,vd1362)
| ~ rR(X772,vd1361,vd1363)
| ~ rpoint(X772) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])]) ).
cnf(c_0_35,plain,
( rR(X1,X2,X3)
| ~ rR(X1,X3,X2)
| X2 != X4
| ~ rpoint(X4)
| X1 != X5
| ~ rpoint(X5)
| X3 != X6
| ~ rpoint(X6) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,plain,
( X1 = X2
| X3 = X4
| rR(vskolem1120(X1,X1,X2,X2,X3,X3,X4,X4),X1,X2)
| ~ rless(vf(X3,X4),vf(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rpoint(X3)
| ~ rpoint(X4) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_26])])])]) ).
cnf(c_0_37,plain,
rless(vf(esk11_0,esk1_0),vf(esk10_0,esk11_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_38,plain,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_39,plain,
esk11_0 != esk1_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_20]),c_0_19]) ).
cnf(c_0_40,plain,
esk11_0 != esk10_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_21]),c_0_19]) ).
cnf(c_0_41,plain,
( X1 = X2
| X3 = X4
| rpoint(vskolem1120(X1,X1,X2,X2,X3,X3,X4,X4))
| ~ rless(vf(X3,X4),vf(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rpoint(X3)
| ~ rpoint(X4) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_33])])])]) ).
fof(c_0_42,plain,
! [X773,X774,X775,X776,X777,X778,X779,X780] :
( ~ rless(vf(X777,X779),vf(X773,X775))
| X777 = X779
| X773 = X775
| X779 != X780
| ~ rpoint(X780)
| X777 != X778
| ~ rpoint(X778)
| X775 != X776
| ~ rpoint(X776)
| X773 != X774
| ~ rpoint(X774)
| vf(X773,vskolem1120(X773,X774,X775,X776,X777,X778,X779,X780)) = vf(X777,X779) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(238), 0), 0)'])]) ).
cnf(c_0_43,negated_conjecture,
( vf(vd1363,X1) != vf(vd1361,vd1362)
| ~ rR(X1,vd1361,vd1363)
| ~ rpoint(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
( rR(X1,X2,X3)
| ~ rpoint(X3)
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rR(X1,X3,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_35])])]) ).
cnf(c_0_45,plain,
rR(vskolem1120(esk10_0,esk10_0,esk11_0,esk11_0,esk11_0,esk11_0,esk1_0,esk1_0),esk10_0,esk11_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_30]),c_0_29]),c_0_38])]),c_0_39]),c_0_40]) ).
cnf(c_0_46,plain,
rpoint(vskolem1120(esk10_0,esk10_0,esk11_0,esk11_0,esk11_0,esk11_0,esk1_0,esk1_0)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_37]),c_0_30]),c_0_29]),c_0_38])]),c_0_39]),c_0_40]) ).
cnf(c_0_47,plain,
( X1 = X2
| X3 = X4
| vf(X3,vskolem1120(X3,X8,X4,X7,X1,X6,X2,X5)) = vf(X1,X2)
| ~ rless(vf(X1,X2),vf(X3,X4))
| X2 != X5
| ~ rpoint(X5)
| X1 != X6
| ~ rpoint(X6)
| X4 != X7
| ~ rpoint(X7)
| X3 != X8
| ~ rpoint(X8) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( vf(esk10_0,X1) != vf(esk11_0,esk1_0)
| ~ rpoint(X1)
| ~ rR(X1,esk11_0,esk10_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_21]),c_0_19]),c_0_20]),c_0_19]),c_0_21]) ).
cnf(c_0_49,plain,
rR(vskolem1120(esk10_0,esk10_0,esk11_0,esk11_0,esk11_0,esk11_0,esk1_0,esk1_0),esk11_0,esk10_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_30]),c_0_46]),c_0_29])]) ).
cnf(c_0_50,plain,
( vf(X1,vskolem1120(X1,X1,X2,X2,X3,X3,X4,X4)) = vf(X3,X4)
| X1 = X2
| X3 = X4
| ~ rless(vf(X3,X4),vf(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rpoint(X3)
| ~ rpoint(X4) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_47])])])]) ).
cnf(c_0_51,negated_conjecture,
vf(esk10_0,vskolem1120(esk10_0,esk10_0,esk11_0,esk11_0,esk11_0,esk11_0,esk1_0,esk1_0)) != vf(esk11_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_46])]) ).
cnf(c_0_52,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_37]),c_0_30]),c_0_29]),c_0_38])]),c_0_39]),c_0_40]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO336+1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 06:34:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.51 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.2fv9i4kWVJ/E---3.1_29467.p
% 1.06/0.95 # Version: 3.1pre001
% 1.06/0.95 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.06/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.95 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.06/0.95 # Starting new_bool_3 with 300s (1) cores
% 1.06/0.95 # Starting new_bool_1 with 300s (1) cores
% 1.06/0.95 # Starting sh5l with 300s (1) cores
% 1.06/0.95 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 29621 completed with status 0
% 1.06/0.95 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.06/0.95 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.06/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.95 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.06/0.95 # No SInE strategy applied
% 1.06/0.95 # Search class: FGHSF-FSLM33-SFFFFFNN
% 1.06/0.95 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.06/0.95 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 1.06/0.95 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.06/0.95 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 1.06/0.95 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.06/0.95 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 1.06/0.95 # G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 29629 completed with status 0
% 1.06/0.95 # Result found by G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 1.06/0.95 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.06/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.95 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.06/0.95 # No SInE strategy applied
% 1.06/0.95 # Search class: FGHSF-FSLM33-SFFFFFNN
% 1.06/0.95 # Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.06/0.95 # Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U with 271s (1) cores
% 1.06/0.95 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.06/0.95 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 1.06/0.95 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.06/0.95 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 1.06/0.95 # Preprocessing time : 0.037 s
% 1.06/0.95 # Presaturation interreduction done
% 1.06/0.95
% 1.06/0.95 # Proof found!
% 1.06/0.95 # SZS status Theorem
% 1.06/0.95 # SZS output start CNFRefutation
% See solution above
% 1.06/0.95 # Parsed axioms : 126
% 1.06/0.95 # Removed by relevancy pruning/SinE : 0
% 1.06/0.95 # Initial clauses : 284
% 1.06/0.95 # Removed in clause preprocessing : 2
% 1.06/0.95 # Initial clauses in saturation : 282
% 1.06/0.95 # Processed clauses : 1241
% 1.06/0.95 # ...of these trivial : 12
% 1.06/0.95 # ...subsumed : 231
% 1.06/0.95 # ...remaining for further processing : 997
% 1.06/0.95 # Other redundant clauses eliminated : 1194
% 1.06/0.95 # Clauses deleted for lack of memory : 0
% 1.06/0.95 # Backward-subsumed : 12
% 1.06/0.95 # Backward-rewritten : 17
% 1.06/0.95 # Generated clauses : 2375
% 1.06/0.95 # ...of the previous two non-redundant : 2339
% 1.06/0.95 # ...aggressively subsumed : 0
% 1.06/0.95 # Contextual simplify-reflections : 41
% 1.06/0.95 # Paramodulations : 2069
% 1.06/0.95 # Factorizations : 8
% 1.06/0.95 # NegExts : 0
% 1.06/0.95 # Equation resolutions : 1228
% 1.06/0.95 # Total rewrite steps : 1020
% 1.06/0.95 # Propositional unsat checks : 0
% 1.06/0.95 # Propositional check models : 0
% 1.06/0.95 # Propositional check unsatisfiable : 0
% 1.06/0.95 # Propositional clauses : 0
% 1.06/0.95 # Propositional clauses after purity: 0
% 1.06/0.95 # Propositional unsat core size : 0
% 1.06/0.95 # Propositional preprocessing time : 0.000
% 1.06/0.95 # Propositional encoding time : 0.000
% 1.06/0.95 # Propositional solver time : 0.000
% 1.06/0.95 # Success case prop preproc time : 0.000
% 1.06/0.95 # Success case prop encoding time : 0.000
% 1.06/0.95 # Success case prop solver time : 0.000
% 1.06/0.95 # Current number of processed clauses : 430
% 1.06/0.95 # Positive orientable unit clauses : 39
% 1.06/0.95 # Positive unorientable unit clauses: 0
% 1.06/0.95 # Negative unit clauses : 33
% 1.06/0.95 # Non-unit-clauses : 358
% 1.06/0.95 # Current number of unprocessed clauses: 1589
% 1.06/0.95 # ...number of literals in the above : 21519
% 1.06/0.95 # Current number of archived formulas : 0
% 1.06/0.95 # Current number of archived clauses : 309
% 1.06/0.95 # Clause-clause subsumption calls (NU) : 322699
% 1.06/0.95 # Rec. Clause-clause subsumption calls : 11900
% 1.06/0.95 # Non-unit clause-clause subsumptions : 271
% 1.06/0.95 # Unit Clause-clause subsumption calls : 2677
% 1.06/0.95 # Rewrite failures with RHS unbound : 0
% 1.06/0.95 # BW rewrite match attempts : 16
% 1.06/0.95 # BW rewrite match successes : 8
% 1.06/0.95 # Condensation attempts : 0
% 1.06/0.95 # Condensation successes : 0
% 1.06/0.95 # Termbank termtop insertions : 133290
% 1.06/0.95
% 1.06/0.95 # -------------------------------------------------
% 1.06/0.95 # User time : 0.384 s
% 1.06/0.95 # System time : 0.017 s
% 1.06/0.95 # Total time : 0.401 s
% 1.06/0.95 # Maximum resident set size: 4516 pages
% 1.06/0.95
% 1.06/0.95 # -------------------------------------------------
% 1.06/0.95 # User time : 1.531 s
% 1.06/0.95 # System time : 0.041 s
% 1.06/0.95 # Total time : 1.572 s
% 1.06/0.95 # Maximum resident set size: 2560 pages
% 1.06/0.95 % E---3.1 exiting
%------------------------------------------------------------------------------