TSTP Solution File: GEO094+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO094+1 : TPTP v8.1.2. Released v2.4.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:41:36 EDT 2024
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 42 ( 15 unt; 0 def)
% Number of atoms : 166 ( 0 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 199 ( 75 ~; 80 |; 34 &)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 81 ( 4 sgn 45 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(proposition_2_14_3,conjecture,
! [X1,X2,X4,X3] :
( ( meet(X3,X2,X4)
& part_of(X2,X1)
& part_of(X4,X1) )
=> ~ end_point(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.T6AeB1e6p5/E---3.1_13431.p',proposition_2_14_3) ).
fof(end_point_defn,axiom,
! [X3,X1] :
( end_point(X3,X1)
<=> ( incident_c(X3,X1)
& ! [X2,X4] :
( ( part_of(X2,X1)
& part_of(X4,X1)
& incident_c(X3,X2)
& incident_c(X3,X4) )
=> ( part_of(X2,X4)
| part_of(X4,X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.T6AeB1e6p5/E---3.1_13431.p',end_point_defn) ).
fof(meet_defn,axiom,
! [X3,X1,X2] :
( meet(X3,X1,X2)
<=> ( incident_c(X3,X1)
& incident_c(X3,X2)
& ! [X5] :
( ( incident_c(X5,X1)
& incident_c(X5,X2) )
=> ( end_point(X5,X1)
& end_point(X5,X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.T6AeB1e6p5/E---3.1_13431.p',meet_defn) ).
fof(inner_point_defn,axiom,
! [X3,X1] :
( inner_point(X3,X1)
<=> ( incident_c(X3,X1)
& ~ end_point(X3,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.T6AeB1e6p5/E---3.1_13431.p',inner_point_defn) ).
fof(c3,axiom,
! [X1] :
? [X3] : inner_point(X3,X1),
file('/export/starexec/sandbox/tmp/tmp.T6AeB1e6p5/E---3.1_13431.p',c3) ).
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.T6AeB1e6p5/E---3.1_13431.p',part_of_defn) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X4,X3] :
( ( meet(X3,X2,X4)
& part_of(X2,X1)
& part_of(X4,X1) )
=> ~ end_point(X3,X1) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[proposition_2_14_3])]) ).
fof(c_0_7,plain,
! [X25,X26,X27,X28,X29,X30] :
( ( incident_c(X25,X26)
| ~ end_point(X25,X26) )
& ( ~ part_of(X27,X26)
| ~ part_of(X28,X26)
| ~ incident_c(X25,X27)
| ~ incident_c(X25,X28)
| part_of(X27,X28)
| part_of(X28,X27)
| ~ end_point(X25,X26) )
& ( part_of(esk7_2(X29,X30),X30)
| ~ incident_c(X29,X30)
| end_point(X29,X30) )
& ( part_of(esk8_2(X29,X30),X30)
| ~ incident_c(X29,X30)
| end_point(X29,X30) )
& ( incident_c(X29,esk7_2(X29,X30))
| ~ incident_c(X29,X30)
| end_point(X29,X30) )
& ( incident_c(X29,esk8_2(X29,X30))
| ~ incident_c(X29,X30)
| end_point(X29,X30) )
& ( ~ part_of(esk7_2(X29,X30),esk8_2(X29,X30))
| ~ incident_c(X29,X30)
| end_point(X29,X30) )
& ( ~ part_of(esk8_2(X29,X30),esk7_2(X29,X30))
| ~ incident_c(X29,X30)
| end_point(X29,X30) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[end_point_defn])])])])])])]) ).
fof(c_0_8,negated_conjecture,
( meet(esk4_0,esk2_0,esk3_0)
& part_of(esk2_0,esk1_0)
& part_of(esk3_0,esk1_0)
& end_point(esk4_0,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X38,X39,X40,X41,X42,X43,X44] :
( ( incident_c(X38,X39)
| ~ meet(X38,X39,X40) )
& ( incident_c(X38,X40)
| ~ meet(X38,X39,X40) )
& ( end_point(X41,X39)
| ~ incident_c(X41,X39)
| ~ incident_c(X41,X40)
| ~ meet(X38,X39,X40) )
& ( end_point(X41,X40)
| ~ incident_c(X41,X39)
| ~ incident_c(X41,X40)
| ~ meet(X38,X39,X40) )
& ( incident_c(esk9_3(X42,X43,X44),X43)
| ~ incident_c(X42,X43)
| ~ incident_c(X42,X44)
| meet(X42,X43,X44) )
& ( incident_c(esk9_3(X42,X43,X44),X44)
| ~ incident_c(X42,X43)
| ~ incident_c(X42,X44)
| meet(X42,X43,X44) )
& ( ~ end_point(esk9_3(X42,X43,X44),X43)
| ~ end_point(esk9_3(X42,X43,X44),X44)
| ~ incident_c(X42,X43)
| ~ incident_c(X42,X44)
| meet(X42,X43,X44) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[meet_defn])])])])])])]) ).
cnf(c_0_10,plain,
( part_of(X1,X3)
| part_of(X3,X1)
| ~ part_of(X1,X2)
| ~ part_of(X3,X2)
| ~ incident_c(X4,X1)
| ~ incident_c(X4,X3)
| ~ end_point(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
end_point(esk4_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( incident_c(X1,X2)
| ~ meet(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
meet(esk4_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X3,X1] :
( inner_point(X3,X1)
<=> ( incident_c(X3,X1)
& ~ end_point(X3,X1) ) ),
inference(fof_simplification,[status(thm)],[inner_point_defn]) ).
cnf(c_0_15,negated_conjecture,
( part_of(X1,X2)
| part_of(X2,X1)
| ~ incident_c(esk4_0,X1)
| ~ incident_c(esk4_0,X2)
| ~ part_of(X1,esk1_0)
| ~ part_of(X2,esk1_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
part_of(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
incident_c(esk4_0,esk3_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( incident_c(X1,X2)
| ~ meet(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_19,plain,
! [X66,X67] :
( ( incident_c(X66,X67)
| ~ inner_point(X66,X67) )
& ( ~ end_point(X66,X67)
| ~ inner_point(X66,X67) )
& ( ~ incident_c(X66,X67)
| end_point(X66,X67)
| inner_point(X66,X67) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_20,plain,
! [X68] : inner_point(esk15_1(X68),X68),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c3])]) ).
fof(c_0_21,plain,
! [X19,X20,X21,X22,X23] :
( ( ~ part_of(X20,X19)
| ~ incident_c(X21,X20)
| incident_c(X21,X19) )
& ( incident_c(esk6_2(X22,X23),X23)
| part_of(X23,X22) )
& ( ~ incident_c(esk6_2(X22,X23),X22)
| part_of(X23,X22) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_22,negated_conjecture,
( part_of(X1,esk3_0)
| part_of(esk3_0,X1)
| ~ incident_c(esk4_0,X1)
| ~ part_of(X1,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_23,negated_conjecture,
incident_c(esk4_0,esk2_0),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_24,negated_conjecture,
part_of(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,plain,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
inner_point(esk15_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( end_point(X1,X2)
| ~ incident_c(X1,X2)
| ~ incident_c(X1,X3)
| ~ meet(X4,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,plain,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
( incident_c(X3,X2)
| ~ part_of(X1,X2)
| ~ incident_c(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
( part_of(esk3_0,esk2_0)
| part_of(esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_31,plain,
~ end_point(esk15_1(X1),X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( end_point(X1,esk2_0)
| ~ incident_c(X1,esk3_0)
| ~ incident_c(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_33,plain,
incident_c(esk15_1(X1),X1),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_34,plain,
( end_point(X1,X2)
| ~ incident_c(X1,X3)
| ~ incident_c(X1,X2)
| ~ meet(X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,negated_conjecture,
( incident_c(X1,esk3_0)
| part_of(esk3_0,esk2_0)
| ~ incident_c(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
~ incident_c(esk15_1(esk2_0),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_37,negated_conjecture,
( end_point(X1,esk3_0)
| ~ incident_c(X1,esk2_0)
| ~ incident_c(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_13]) ).
cnf(c_0_38,negated_conjecture,
part_of(esk3_0,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_33]),c_0_36]) ).
cnf(c_0_39,negated_conjecture,
~ incident_c(esk15_1(esk3_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_37]),c_0_33])]) ).
cnf(c_0_40,negated_conjecture,
( incident_c(X1,esk2_0)
| ~ incident_c(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : GEO094+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri May 3 18:21:37 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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.T6AeB1e6p5/E---3.1_13431.p
% 0.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # new_bool_1 with pid 13511 completed with status 0
% 0.19/0.49 # Result found by new_bool_1
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHSF-FFMS32-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 0.19/0.49 # G-E--_301_C18_F1_URBAN_S0Y with pid 13513 completed with status 0
% 0.19/0.49 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHSF-FFMS32-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.002 s
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 17
% 0.19/0.49 # Removed by relevancy pruning/SinE : 4
% 0.19/0.49 # Initial clauses : 41
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 41
% 0.19/0.49 # Processed clauses : 68
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 0
% 0.19/0.49 # ...remaining for further processing : 68
% 0.19/0.49 # Other redundant clauses eliminated : 3
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 2
% 0.19/0.49 # Generated clauses : 127
% 0.19/0.49 # ...of the previous two non-redundant : 100
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 113
% 0.19/0.49 # Factorizations : 8
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 6
% 0.19/0.49 # Disequality decompositions : 0
% 0.19/0.49 # Total rewrite steps : 17
% 0.19/0.49 # ...of those cached : 7
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 66
% 0.19/0.49 # Positive orientable unit clauses : 14
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 3
% 0.19/0.49 # Non-unit-clauses : 49
% 0.19/0.49 # Current number of unprocessed clauses: 73
% 0.19/0.49 # ...number of literals in the above : 323
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 2
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 247
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 125
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 72
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 18
% 0.19/0.49 # BW rewrite match successes : 1
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 4693
% 0.19/0.49 # Search garbage collected termcells : 897
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.012 s
% 0.19/0.49 # System time : 0.000 s
% 0.19/0.49 # Total time : 0.012 s
% 0.19/0.49 # Maximum resident set size: 1880 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.015 s
% 0.19/0.49 # System time : 0.001 s
% 0.19/0.49 # Total time : 0.016 s
% 0.19/0.49 # Maximum resident set size: 1708 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------