TSTP Solution File: GEO526+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO526+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:32:55 EDT 2023
% Result : Theorem 10.33s 1.94s
% Output : CNFRefutation 10.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 58 ( 22 unt; 0 def)
% Number of atoms : 128 ( 16 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 133 ( 63 ~; 61 |; 9 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 132 ( 0 sgn; 96 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSatz10_12c,conjecture,
! [X12,X15,X14,X20,X22] :
( ~ s_r(X12,X15,X14)
| ~ s_r(X20,X15,X22)
| ~ s_e(X12,X15,X20,X15)
| ~ s_e(X15,X14,X15,X22)
| s_e(X12,X14,X20,X22)
| X15 != midpoint(X14,X22)
| X14 = X22 ),
file('/export/starexec/sandbox2/tmp/tmp.1k7a6FERtP/E---3.1_5971.p',aSatz10_12c) ).
fof(aSatz7_6,axiom,
! [X13,X12,X16] :
( ~ s_m(X13,X12,X16)
| X16 = s(X12,X13) ),
file('/export/starexec/sandbox2/tmp/tmp.1k7a6FERtP/E---3.1_5971.p',aSatz7_6) ).
fof(aSatz8_22,axiom,
! [X12,X15] : s_m(X12,midpoint(X12,X15),X15),
file('/export/starexec/sandbox2/tmp/tmp.1k7a6FERtP/E---3.1_5971.p',aSatz8_22) ).
fof(aSatz8_4,axiom,
! [X12,X15,X14] :
( ~ s_r(X12,X15,X14)
| s_r(X12,X15,s(X15,X14)) ),
file('/export/starexec/sandbox2/tmp/tmp.1k7a6FERtP/E---3.1_5971.p',aSatz8_4) ).
fof(aSatz8_2,axiom,
! [X12,X15,X14] :
( ~ s_r(X12,X15,X14)
| s_r(X14,X15,X12) ),
file('/export/starexec/sandbox2/tmp/tmp.1k7a6FERtP/E---3.1_5971.p',aSatz8_2) ).
fof(aSatz2_2,axiom,
! [X12,X15,X14,X17] :
( ~ s_e(X12,X15,X14,X17)
| s_e(X14,X17,X12,X15) ),
file('/export/starexec/sandbox2/tmp/tmp.1k7a6FERtP/E---3.1_5971.p',aSatz2_2) ).
fof(d_Defn8_1,axiom,
! [X12,X15,X14] :
( ( ~ s_r(X12,X15,X14)
| s_e(X12,X14,X12,s(X15,X14)) )
& ( s_r(X12,X15,X14)
| ~ s_e(X12,X14,X12,s(X15,X14)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1k7a6FERtP/E---3.1_5971.p',d_Defn8_1) ).
fof(aSatz7_7,axiom,
! [X12,X13] : s(X12,s(X12,X13)) = X13,
file('/export/starexec/sandbox2/tmp/tmp.1k7a6FERtP/E---3.1_5971.p',aSatz7_7) ).
fof(aSatz10_12b,axiom,
! [X12,X15,X14,X20] :
( ~ s_r(X12,X15,X14)
| ~ s_r(X20,X15,X14)
| ~ s_e(X12,X15,X20,X15)
| s_e(X12,X14,X20,X14) ),
file('/export/starexec/sandbox2/tmp/tmp.1k7a6FERtP/E---3.1_5971.p',aSatz10_12b) ).
fof(aA2,axiom,
! [X1,X2,X3,X4,X5,X6] :
( ~ s_e(X1,X2,X3,X4)
| ~ s_e(X1,X2,X5,X6)
| s_e(X3,X4,X5,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.1k7a6FERtP/E---3.1_5971.p',aA2) ).
fof(c_0_10,negated_conjecture,
~ ! [X12,X15,X14,X20,X22] :
( ~ s_r(X12,X15,X14)
| ~ s_r(X20,X15,X22)
| ~ s_e(X12,X15,X20,X15)
| ~ s_e(X15,X14,X15,X22)
| s_e(X12,X14,X20,X22)
| X15 != midpoint(X14,X22)
| X14 = X22 ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[aSatz10_12c])]) ).
fof(c_0_11,plain,
! [X13,X12,X16] :
( ~ s_m(X13,X12,X16)
| X16 = s(X12,X13) ),
inference(fof_simplification,[status(thm)],[aSatz7_6]) ).
fof(c_0_12,plain,
! [X52,X53] : s_m(X52,midpoint(X52,X53),X53),
inference(variable_rename,[status(thm)],[aSatz8_22]) ).
fof(c_0_13,negated_conjecture,
( s_r(esk1_0,esk2_0,esk3_0)
& s_r(esk4_0,esk2_0,esk5_0)
& s_e(esk1_0,esk2_0,esk4_0,esk2_0)
& s_e(esk2_0,esk3_0,esk2_0,esk5_0)
& ~ s_e(esk1_0,esk3_0,esk4_0,esk5_0)
& esk2_0 = midpoint(esk3_0,esk5_0)
& esk3_0 != esk5_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_14,plain,
! [X12,X15,X14] :
( ~ s_r(X12,X15,X14)
| s_r(X12,X15,s(X15,X14)) ),
inference(fof_simplification,[status(thm)],[aSatz8_4]) ).
fof(c_0_15,plain,
! [X211,X212,X213] :
( ~ s_m(X211,X212,X213)
| X213 = s(X212,X211) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
s_m(X1,midpoint(X1,X2),X2),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = midpoint(esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X12,X15,X14] :
( ~ s_r(X12,X15,X14)
| s_r(X14,X15,X12) ),
inference(fof_simplification,[status(thm)],[aSatz8_2]) ).
fof(c_0_19,plain,
! [X156,X157,X158] :
( ~ s_r(X156,X157,X158)
| s_r(X156,X157,s(X157,X158)) ),
inference(variable_rename,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( X3 = s(X2,X1)
| ~ s_m(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
s_m(esk3_0,esk2_0,esk5_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_22,plain,
! [X149,X150,X151] :
( ~ s_r(X149,X150,X151)
| s_r(X151,X150,X149) ),
inference(variable_rename,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( s_r(X1,X2,s(X2,X3))
| ~ s_r(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
s(esk2_0,esk3_0) = esk5_0,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_25,plain,
! [X12,X15,X14,X17] :
( ~ s_e(X12,X15,X14,X17)
| s_e(X14,X17,X12,X15) ),
inference(fof_simplification,[status(thm)],[aSatz2_2]) ).
fof(c_0_26,plain,
! [X12,X15,X14] :
( ( ~ s_r(X12,X15,X14)
| s_e(X12,X14,X12,s(X15,X14)) )
& ( s_r(X12,X15,X14)
| ~ s_e(X12,X14,X12,s(X15,X14)) ) ),
inference(fof_simplification,[status(thm)],[d_Defn8_1]) ).
fof(c_0_27,plain,
! [X415,X416] : s(X415,s(X415,X416)) = X416,
inference(variable_rename,[status(thm)],[aSatz7_7]) ).
cnf(c_0_28,plain,
( s_r(X3,X2,X1)
| ~ s_r(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( s_r(X1,esk2_0,esk5_0)
| ~ s_r(X1,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_30,plain,
! [X12,X15,X14,X20] :
( ~ s_r(X12,X15,X14)
| ~ s_r(X20,X15,X14)
| ~ s_e(X12,X15,X20,X15)
| s_e(X12,X14,X20,X14) ),
inference(fof_simplification,[status(thm)],[aSatz10_12b]) ).
fof(c_0_31,plain,
! [X88,X89,X90,X91] :
( ~ s_e(X88,X89,X90,X91)
| s_e(X90,X91,X88,X89) ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_32,plain,
! [X195,X196,X197] :
( ( ~ s_r(X195,X196,X197)
| s_e(X195,X197,X195,s(X196,X197)) )
& ( s_r(X195,X196,X197)
| ~ s_e(X195,X197,X195,s(X196,X197)) ) ),
inference(variable_rename,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
s(X1,s(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( s_r(esk5_0,esk2_0,X1)
| ~ s_r(X1,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
s_r(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_36,plain,
! [X191,X192,X193,X194] :
( ~ s_r(X191,X192,X193)
| ~ s_r(X194,X192,X193)
| ~ s_e(X191,X192,X194,X192)
| s_e(X191,X193,X194,X193) ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
( s_e(X3,X4,X1,X2)
| ~ s_e(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
s_e(esk1_0,esk2_0,esk4_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_39,plain,
! [X1,X2,X3,X4,X5,X6] :
( ~ s_e(X1,X2,X3,X4)
| ~ s_e(X1,X2,X5,X6)
| s_e(X3,X4,X5,X6) ),
inference(fof_simplification,[status(thm)],[aA2]) ).
cnf(c_0_40,plain,
( s_e(X1,X3,X1,s(X2,X3))
| ~ s_r(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,negated_conjecture,
s(esk2_0,esk5_0) = esk3_0,
inference(spm,[status(thm)],[c_0_33,c_0_24]) ).
cnf(c_0_42,negated_conjecture,
s_r(esk5_0,esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,plain,
( s_e(X1,X3,X4,X3)
| ~ s_r(X1,X2,X3)
| ~ s_r(X4,X2,X3)
| ~ s_e(X1,X2,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,negated_conjecture,
s_e(esk4_0,esk2_0,esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
fof(c_0_45,plain,
! [X69,X70,X71,X72,X73,X74] :
( ~ s_e(X69,X70,X71,X72)
| ~ s_e(X69,X70,X73,X74)
| s_e(X71,X72,X73,X74) ),
inference(variable_rename,[status(thm)],[c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( s_e(X1,esk5_0,X1,esk3_0)
| ~ s_r(X1,esk2_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
s_r(esk1_0,esk2_0,esk5_0),
inference(spm,[status(thm)],[c_0_28,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( s_e(esk4_0,X1,esk1_0,X1)
| ~ s_r(esk1_0,esk2_0,X1)
| ~ s_r(esk4_0,esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
s_r(esk4_0,esk2_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_50,plain,
( s_e(X3,X4,X5,X6)
| ~ s_e(X1,X2,X3,X4)
| ~ s_e(X1,X2,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,negated_conjecture,
s_e(esk1_0,esk5_0,esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
s_e(esk4_0,esk5_0,esk1_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_29]),c_0_49]),c_0_35])]) ).
cnf(c_0_53,negated_conjecture,
( s_e(X1,X2,esk1_0,esk3_0)
| ~ s_e(esk1_0,esk5_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
s_e(esk1_0,esk5_0,esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_37,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
s_e(esk4_0,esk5_0,esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
~ s_e(esk1_0,esk3_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_55]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.16 % Problem : GEO526+1 : TPTP v8.1.2. Released v7.0.0.
% 0.08/0.17 % Command : run_E %s %d THM
% 0.16/0.39 % Computer : n004.cluster.edu
% 0.16/0.39 % Model : x86_64 x86_64
% 0.16/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39 % Memory : 8042.1875MB
% 0.16/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39 % CPULimit : 2400
% 0.16/0.39 % WCLimit : 300
% 0.16/0.39 % DateTime : Tue Oct 3 06:41:15 EDT 2023
% 0.16/0.39 % CPUTime :
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.56 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.1k7a6FERtP/E---3.1_5971.p
% 10.33/1.94 # Version: 3.1pre001
% 10.33/1.94 # Preprocessing class: FSLSSMSMSSSNFFN.
% 10.33/1.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.33/1.94 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.33/1.94 # Starting new_bool_3 with 300s (1) cores
% 10.33/1.94 # Starting new_bool_1 with 300s (1) cores
% 10.33/1.94 # Starting sh5l with 300s (1) cores
% 10.33/1.94 # new_bool_3 with pid 6055 completed with status 0
% 10.33/1.94 # Result found by new_bool_3
% 10.33/1.94 # Preprocessing class: FSLSSMSMSSSNFFN.
% 10.33/1.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.33/1.94 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.33/1.94 # Starting new_bool_3 with 300s (1) cores
% 10.33/1.94 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.33/1.94 # Search class: FGHSM-FSLS32-SFFFFFNN
% 10.33/1.94 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 10.33/1.94 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 10.33/1.94 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 6058 completed with status 0
% 10.33/1.94 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 10.33/1.94 # Preprocessing class: FSLSSMSMSSSNFFN.
% 10.33/1.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.33/1.94 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.33/1.94 # Starting new_bool_3 with 300s (1) cores
% 10.33/1.94 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.33/1.94 # Search class: FGHSM-FSLS32-SFFFFFNN
% 10.33/1.94 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 10.33/1.94 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 10.33/1.94 # Preprocessing time : 0.004 s
% 10.33/1.94 # Presaturation interreduction done
% 10.33/1.94
% 10.33/1.94 # Proof found!
% 10.33/1.94 # SZS status Theorem
% 10.33/1.94 # SZS output start CNFRefutation
% See solution above
% 10.33/1.94 # Parsed axioms : 210
% 10.33/1.94 # Removed by relevancy pruning/SinE : 62
% 10.33/1.94 # Initial clauses : 164
% 10.33/1.94 # Removed in clause preprocessing : 0
% 10.33/1.94 # Initial clauses in saturation : 164
% 10.33/1.94 # Processed clauses : 12767
% 10.33/1.94 # ...of these trivial : 702
% 10.33/1.94 # ...subsumed : 8551
% 10.33/1.94 # ...remaining for further processing : 3514
% 10.33/1.94 # Other redundant clauses eliminated : 115
% 10.33/1.94 # Clauses deleted for lack of memory : 0
% 10.33/1.94 # Backward-subsumed : 155
% 10.33/1.94 # Backward-rewritten : 23
% 10.33/1.94 # Generated clauses : 83133
% 10.33/1.94 # ...of the previous two non-redundant : 74659
% 10.33/1.94 # ...aggressively subsumed : 0
% 10.33/1.94 # Contextual simplify-reflections : 21
% 10.33/1.94 # Paramodulations : 83008
% 10.33/1.94 # Factorizations : 2
% 10.33/1.94 # NegExts : 0
% 10.33/1.94 # Equation resolutions : 119
% 10.33/1.94 # Total rewrite steps : 27439
% 10.33/1.94 # Propositional unsat checks : 0
% 10.33/1.94 # Propositional check models : 0
% 10.33/1.94 # Propositional check unsatisfiable : 0
% 10.33/1.94 # Propositional clauses : 0
% 10.33/1.94 # Propositional clauses after purity: 0
% 10.33/1.94 # Propositional unsat core size : 0
% 10.33/1.94 # Propositional preprocessing time : 0.000
% 10.33/1.94 # Propositional encoding time : 0.000
% 10.33/1.94 # Propositional solver time : 0.000
% 10.33/1.94 # Success case prop preproc time : 0.000
% 10.33/1.94 # Success case prop encoding time : 0.000
% 10.33/1.94 # Success case prop solver time : 0.000
% 10.33/1.94 # Current number of processed clauses : 3177
% 10.33/1.94 # Positive orientable unit clauses : 512
% 10.33/1.94 # Positive unorientable unit clauses: 1
% 10.33/1.94 # Negative unit clauses : 201
% 10.33/1.94 # Non-unit-clauses : 2463
% 10.33/1.94 # Current number of unprocessed clauses: 61791
% 10.33/1.94 # ...number of literals in the above : 245135
% 10.33/1.94 # Current number of archived formulas : 0
% 10.33/1.94 # Current number of archived clauses : 329
% 10.33/1.94 # Clause-clause subsumption calls (NU) : 1578419
% 10.33/1.94 # Rec. Clause-clause subsumption calls : 1096278
% 10.33/1.94 # Non-unit clause-clause subsumptions : 6252
% 10.33/1.94 # Unit Clause-clause subsumption calls : 60928
% 10.33/1.94 # Rewrite failures with RHS unbound : 0
% 10.33/1.94 # BW rewrite match attempts : 6185
% 10.33/1.94 # BW rewrite match successes : 35
% 10.33/1.94 # Condensation attempts : 0
% 10.33/1.94 # Condensation successes : 0
% 10.33/1.94 # Termbank termtop insertions : 1266109
% 10.33/1.94
% 10.33/1.94 # -------------------------------------------------
% 10.33/1.94 # User time : 1.288 s
% 10.33/1.94 # System time : 0.038 s
% 10.33/1.94 # Total time : 1.326 s
% 10.33/1.94 # Maximum resident set size: 2908 pages
% 10.33/1.94
% 10.33/1.94 # -------------------------------------------------
% 10.33/1.94 # User time : 1.296 s
% 10.33/1.94 # System time : 0.040 s
% 10.33/1.94 # Total time : 1.336 s
% 10.33/1.94 # Maximum resident set size: 2076 pages
% 10.33/1.94 % E---3.1 exiting
% 10.33/1.94 % E---3.1 exiting
%------------------------------------------------------------------------------