TSTP Solution File: GEO093+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO093+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:31:27 EDT 2023
% Result : Theorem 2.48s 0.76s
% Output : CNFRefutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 53 ( 10 unt; 0 def)
% Number of atoms : 153 ( 34 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 150 ( 50 ~; 72 |; 19 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 108 ( 10 sgn; 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sum_defn,axiom,
! [X1,X2,X4] :
( X1 = sum(X2,X4)
<=> ! [X5] :
( incident_c(X5,X1)
<=> ( incident_c(X5,X2)
| incident_c(X5,X4) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.yuuMz5dNQP/E---3.1_9683.p',sum_defn) ).
fof(part_of_defn,axiom,
! [X1,X2] :
( part_of(X2,X1)
<=> ! [X3] :
( incident_c(X3,X2)
=> incident_c(X3,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.yuuMz5dNQP/E---3.1_9683.p',part_of_defn) ).
fof(proposition_2_14_2,conjecture,
! [X1,X2,X4,X3] :
( ( open(X1)
& part_of(X2,X1)
& part_of(X4,X1)
& meet(X3,X2,X4) )
=> open(sum(X2,X4)) ),
file('/export/starexec/sandbox/tmp/tmp.yuuMz5dNQP/E---3.1_9683.p',proposition_2_14_2) ).
fof(c1,axiom,
! [X1,X2] :
( ( part_of(X2,X1)
& X2 != X1 )
=> open(X2) ),
file('/export/starexec/sandbox/tmp/tmp.yuuMz5dNQP/E---3.1_9683.p',c1) ).
fof(c9,axiom,
! [X1,X2] :
( ! [X3] :
( incident_c(X3,X1)
<=> incident_c(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/tmp/tmp.yuuMz5dNQP/E---3.1_9683.p',c9) ).
fof(c_0_5,plain,
! [X18,X19,X20,X21,X22,X23,X24,X25] :
( ( ~ incident_c(X21,X18)
| incident_c(X21,X19)
| incident_c(X21,X20)
| X18 != sum(X19,X20) )
& ( ~ incident_c(X22,X19)
| incident_c(X22,X18)
| X18 != sum(X19,X20) )
& ( ~ incident_c(X22,X20)
| incident_c(X22,X18)
| X18 != sum(X19,X20) )
& ( ~ incident_c(esk6_3(X23,X24,X25),X24)
| ~ incident_c(esk6_3(X23,X24,X25),X23)
| X23 = sum(X24,X25) )
& ( ~ incident_c(esk6_3(X23,X24,X25),X25)
| ~ incident_c(esk6_3(X23,X24,X25),X23)
| X23 = sum(X24,X25) )
& ( incident_c(esk6_3(X23,X24,X25),X23)
| incident_c(esk6_3(X23,X24,X25),X24)
| incident_c(esk6_3(X23,X24,X25),X25)
| X23 = sum(X24,X25) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_defn])])])])])]) ).
fof(c_0_6,plain,
! [X39,X40,X41,X42,X43] :
( ( ~ part_of(X40,X39)
| ~ incident_c(X41,X40)
| incident_c(X41,X39) )
& ( incident_c(esk9_2(X42,X43),X43)
| part_of(X43,X42) )
& ( ~ incident_c(esk9_2(X42,X43),X42)
| part_of(X43,X42) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[part_of_defn])])])])])]) ).
cnf(c_0_7,plain,
( incident_c(X1,X3)
| ~ incident_c(X1,X2)
| X3 != sum(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( part_of(X2,X1)
| ~ incident_c(esk9_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( incident_c(X1,sum(X2,X3))
| ~ incident_c(X1,X3) ),
inference(er,[status(thm)],[c_0_7]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2,X4,X3] :
( ( open(X1)
& part_of(X2,X1)
& part_of(X4,X1)
& meet(X3,X2,X4) )
=> open(sum(X2,X4)) ),
inference(assume_negation,[status(cth)],[proposition_2_14_2]) ).
fof(c_0_11,plain,
! [X16,X17] :
( ~ part_of(X17,X16)
| X17 = X16
| open(X17) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c1])]) ).
cnf(c_0_12,plain,
( part_of(X1,sum(X2,X3))
| ~ incident_c(esk9_2(sum(X2,X3),X1),X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( incident_c(esk9_2(X1,X2),X2)
| part_of(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_14,negated_conjecture,
( open(esk1_0)
& part_of(esk2_0,esk1_0)
& part_of(esk3_0,esk1_0)
& meet(esk4_0,esk2_0,esk3_0)
& ~ open(sum(esk2_0,esk3_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_15,plain,
( X1 = X2
| open(X1)
| ~ part_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
part_of(X1,sum(X2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( incident_c(X1,X3)
| ~ incident_c(X1,X2)
| X3 != sum(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
~ open(sum(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( sum(X1,X2) = X2
| open(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( incident_c(X3,X2)
| ~ part_of(X1,X2)
| ~ incident_c(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
part_of(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( incident_c(X1,sum(X2,X3))
| ~ incident_c(X1,X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
sum(X1,sum(esk2_0,esk3_0)) = sum(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_24,plain,
! [X65,X66] :
( ( ~ incident_c(esk13_2(X65,X66),X65)
| ~ incident_c(esk13_2(X65,X66),X66)
| X65 = X66 )
& ( incident_c(esk13_2(X65,X66),X65)
| incident_c(esk13_2(X65,X66),X66)
| X65 = X66 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c9])])])]) ).
cnf(c_0_25,negated_conjecture,
( incident_c(X1,esk1_0)
| ~ incident_c(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
part_of(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,plain,
( incident_c(esk6_3(X1,X2,X3),X1)
| incident_c(esk6_3(X1,X2,X3),X2)
| incident_c(esk6_3(X1,X2,X3),X3)
| X1 = sum(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_28,negated_conjecture,
( incident_c(X1,sum(esk2_0,esk3_0))
| ~ incident_c(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( incident_c(esk13_2(X1,X2),X1)
| incident_c(esk13_2(X1,X2),X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( part_of(X1,sum(X2,X3))
| ~ incident_c(esk9_2(sum(X2,X3),X1),X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( incident_c(esk9_2(X1,esk3_0),esk1_0)
| part_of(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_32,plain,
( X1 = sum(X2,X3)
| ~ incident_c(esk6_3(X1,X2,X3),X2)
| ~ incident_c(esk6_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_33,negated_conjecture,
( incident_c(X1,esk1_0)
| ~ incident_c(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_26]) ).
cnf(c_0_34,plain,
( sum(X1,X2) = X1
| incident_c(esk6_3(X1,X1,X2),X2)
| incident_c(esk6_3(X1,X1,X2),X1) ),
inference(ef,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
( X1 = X2
| ~ incident_c(esk13_2(X1,X2),X1)
| ~ incident_c(esk13_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,negated_conjecture,
( X1 = X2
| incident_c(esk13_2(X1,X2),sum(esk2_0,esk3_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_28]) ).
cnf(c_0_37,negated_conjecture,
part_of(esk3_0,sum(esk1_0,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( X1 = sum(esk1_0,X2)
| ~ incident_c(esk6_3(X1,esk1_0,X2),esk2_0)
| ~ incident_c(esk6_3(X1,esk1_0,X2),X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
( sum(X1,X2) = X1
| incident_c(esk6_3(X1,X1,X2),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_34]),c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( X1 = sum(esk2_0,esk3_0)
| ~ incident_c(esk13_2(X1,sum(esk2_0,esk3_0)),X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( incident_c(X1,sum(esk1_0,X2))
| ~ incident_c(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( sum(esk1_0,esk2_0) = esk1_0
| ~ incident_c(esk6_3(esk1_0,esk1_0,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
( incident_c(X1,X3)
| incident_c(X1,X4)
| ~ incident_c(X1,X2)
| X2 != sum(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_44,negated_conjecture,
( sum(esk1_0,X1) = sum(esk2_0,esk3_0)
| ~ incident_c(esk13_2(sum(esk1_0,X1),sum(esk2_0,esk3_0)),esk3_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
sum(esk1_0,esk2_0) = esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_33]),c_0_39]) ).
cnf(c_0_46,plain,
( incident_c(X1,X2)
| incident_c(X1,X3)
| ~ incident_c(X1,sum(X3,X2)) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( sum(esk2_0,esk3_0) = esk1_0
| ~ incident_c(esk13_2(esk1_0,sum(esk2_0,esk3_0)),esk3_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
( X1 = X2
| incident_c(esk13_2(X1,X2),esk2_0)
| incident_c(esk13_2(X1,X2),esk3_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_36]) ).
cnf(c_0_49,negated_conjecture,
( sum(esk2_0,esk3_0) = esk1_0
| ~ incident_c(esk13_2(esk1_0,sum(esk2_0,esk3_0)),esk2_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_33]) ).
cnf(c_0_50,negated_conjecture,
sum(esk2_0,esk3_0) = esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_51,negated_conjecture,
open(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_50]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : GEO093+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n028.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 06:51:22 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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/tmp/tmp.yuuMz5dNQP/E---3.1_9683.p
% 2.48/0.76 # Version: 3.1pre001
% 2.48/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.48/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.48/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.48/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.48/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.48/0.76 # Starting sh5l with 300s (1) cores
% 2.48/0.76 # new_bool_1 with pid 9764 completed with status 0
% 2.48/0.76 # Result found by new_bool_1
% 2.48/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.48/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.48/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.48/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.48/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.48/0.76 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.48/0.76 # Search class: FGHSF-FFMS32-SFFFFFNN
% 2.48/0.76 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.48/0.76 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 2.48/0.76 # G-E--_301_C18_F1_URBAN_S0Y with pid 9767 completed with status 0
% 2.48/0.76 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 2.48/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.48/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.48/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.48/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.48/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.48/0.76 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.48/0.76 # Search class: FGHSF-FFMS32-SFFFFFNN
% 2.48/0.76 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.48/0.76 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 2.48/0.76 # Preprocessing time : 0.002 s
% 2.48/0.76
% 2.48/0.76 # Proof found!
% 2.48/0.76 # SZS status Theorem
% 2.48/0.76 # SZS output start CNFRefutation
% See solution above
% 2.48/0.76 # Parsed axioms : 17
% 2.48/0.76 # Removed by relevancy pruning/SinE : 5
% 2.48/0.76 # Initial clauses : 39
% 2.48/0.76 # Removed in clause preprocessing : 0
% 2.48/0.76 # Initial clauses in saturation : 39
% 2.48/0.76 # Processed clauses : 824
% 2.48/0.76 # ...of these trivial : 14
% 2.48/0.76 # ...subsumed : 369
% 2.48/0.76 # ...remaining for further processing : 441
% 2.48/0.76 # Other redundant clauses eliminated : 44
% 2.48/0.76 # Clauses deleted for lack of memory : 0
% 2.48/0.76 # Backward-subsumed : 18
% 2.48/0.76 # Backward-rewritten : 80
% 2.48/0.76 # Generated clauses : 10951
% 2.48/0.76 # ...of the previous two non-redundant : 10268
% 2.48/0.76 # ...aggressively subsumed : 0
% 2.48/0.76 # Contextual simplify-reflections : 24
% 2.48/0.76 # Paramodulations : 10775
% 2.48/0.76 # Factorizations : 125
% 2.48/0.76 # NegExts : 0
% 2.48/0.76 # Equation resolutions : 51
% 2.48/0.76 # Total rewrite steps : 870
% 2.48/0.76 # Propositional unsat checks : 0
% 2.48/0.76 # Propositional check models : 0
% 2.48/0.76 # Propositional check unsatisfiable : 0
% 2.48/0.76 # Propositional clauses : 0
% 2.48/0.76 # Propositional clauses after purity: 0
% 2.48/0.76 # Propositional unsat core size : 0
% 2.48/0.76 # Propositional preprocessing time : 0.000
% 2.48/0.76 # Propositional encoding time : 0.000
% 2.48/0.76 # Propositional solver time : 0.000
% 2.48/0.76 # Success case prop preproc time : 0.000
% 2.48/0.76 # Success case prop encoding time : 0.000
% 2.48/0.76 # Success case prop solver time : 0.000
% 2.48/0.76 # Current number of processed clauses : 343
% 2.48/0.76 # Positive orientable unit clauses : 24
% 2.48/0.76 # Positive unorientable unit clauses: 0
% 2.48/0.76 # Negative unit clauses : 0
% 2.48/0.76 # Non-unit-clauses : 319
% 2.48/0.76 # Current number of unprocessed clauses: 9390
% 2.48/0.76 # ...number of literals in the above : 60016
% 2.48/0.76 # Current number of archived formulas : 0
% 2.48/0.76 # Current number of archived clauses : 98
% 2.48/0.76 # Clause-clause subsumption calls (NU) : 27297
% 2.48/0.76 # Rec. Clause-clause subsumption calls : 4338
% 2.48/0.76 # Non-unit clause-clause subsumptions : 406
% 2.48/0.76 # Unit Clause-clause subsumption calls : 392
% 2.48/0.76 # Rewrite failures with RHS unbound : 0
% 2.48/0.76 # BW rewrite match attempts : 43
% 2.48/0.76 # BW rewrite match successes : 11
% 2.48/0.76 # Condensation attempts : 0
% 2.48/0.76 # Condensation successes : 0
% 2.48/0.76 # Termbank termtop insertions : 247305
% 2.48/0.76
% 2.48/0.76 # -------------------------------------------------
% 2.48/0.76 # User time : 0.309 s
% 2.48/0.76 # System time : 0.009 s
% 2.48/0.76 # Total time : 0.318 s
% 2.48/0.76 # Maximum resident set size: 1856 pages
% 2.48/0.76
% 2.48/0.76 # -------------------------------------------------
% 2.48/0.76 # User time : 0.312 s
% 2.48/0.76 # System time : 0.009 s
% 2.48/0.76 # Total time : 0.321 s
% 2.48/0.76 # Maximum resident set size: 1696 pages
% 2.48/0.76 % E---3.1 exiting
% 2.48/0.76 % E---3.1 exiting
%------------------------------------------------------------------------------