TSTP Solution File: GEO094+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO094+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 : 600s
% DateTime : Sat Jul 16 03:43:19 EDT 2022
% Result : Theorem 4.49s 2.26s
% Output : CNFRefutation 4.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 40 ( 19 unt; 3 nHn; 37 RR)
% Number of literals : 88 ( 0 equ; 53 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 61 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_24,plain,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7h8zcxn6/input.p',i_0_24) ).
cnf(i_0_3,plain,
inner_point(esk1_1(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7h8zcxn6/input.p',i_0_3) ).
cnf(i_0_29,plain,
( end_point(X1,X2)
| ~ incident_c(X1,X3)
| ~ incident_c(X1,X2)
| ~ meet(X4,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7h8zcxn6/input.p',i_0_29) ).
cnf(i_0_41,negated_conjecture,
meet(esk16_0,esk14_0,esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7h8zcxn6/input.p',i_0_41) ).
cnf(i_0_25,plain,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7h8zcxn6/input.p',i_0_25) ).
cnf(i_0_30,plain,
( end_point(X1,X2)
| ~ incident_c(X1,X3)
| ~ incident_c(X1,X2)
| ~ meet(X4,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7h8zcxn6/input.p',i_0_30) ).
cnf(i_0_31,plain,
( incident_c(X1,X2)
| ~ meet(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7h8zcxn6/input.p',i_0_31) ).
cnf(i_0_37,plain,
( incident_c(X1,X2)
| ~ part_of(X3,X2)
| ~ incident_c(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7h8zcxn6/input.p',i_0_37) ).
cnf(i_0_21,plain,
( part_of(X1,X2)
| part_of(X2,X1)
| ~ part_of(X1,X3)
| ~ part_of(X2,X3)
| ~ end_point(X4,X3)
| ~ incident_c(X4,X1)
| ~ incident_c(X4,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7h8zcxn6/input.p',i_0_21) ).
cnf(i_0_32,plain,
( incident_c(X1,X2)
| ~ meet(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7h8zcxn6/input.p',i_0_32) ).
cnf(i_0_40,negated_conjecture,
part_of(esk14_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7h8zcxn6/input.p',i_0_40) ).
cnf(i_0_38,negated_conjecture,
end_point(esk16_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7h8zcxn6/input.p',i_0_38) ).
cnf(i_0_39,negated_conjecture,
part_of(esk15_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7h8zcxn6/input.p',i_0_39) ).
cnf(c_0_55,plain,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
i_0_24 ).
cnf(c_0_56,plain,
inner_point(esk1_1(X1),X1),
i_0_3 ).
cnf(c_0_57,plain,
( end_point(X1,X2)
| ~ incident_c(X1,X3)
| ~ incident_c(X1,X2)
| ~ meet(X4,X3,X2) ),
i_0_29 ).
cnf(c_0_58,negated_conjecture,
meet(esk16_0,esk14_0,esk15_0),
i_0_41 ).
cnf(c_0_59,plain,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
i_0_25 ).
cnf(c_0_60,plain,
( end_point(X1,X2)
| ~ incident_c(X1,X3)
| ~ incident_c(X1,X2)
| ~ meet(X4,X2,X3) ),
i_0_30 ).
cnf(c_0_61,plain,
( incident_c(X1,X2)
| ~ meet(X1,X3,X2) ),
i_0_31 ).
cnf(c_0_62,plain,
~ end_point(esk1_1(X1),X1),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,negated_conjecture,
( end_point(X1,esk15_0)
| ~ incident_c(X1,esk14_0)
| ~ incident_c(X1,esk15_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_64,plain,
incident_c(esk1_1(X1),X1),
inference(spm,[status(thm)],[c_0_59,c_0_56]) ).
cnf(c_0_65,plain,
( incident_c(X1,X2)
| ~ part_of(X3,X2)
| ~ incident_c(X1,X3) ),
i_0_37 ).
cnf(c_0_66,negated_conjecture,
( end_point(X1,esk14_0)
| ~ incident_c(X1,esk15_0)
| ~ incident_c(X1,esk14_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_58]) ).
cnf(c_0_67,plain,
( part_of(X1,X2)
| part_of(X2,X1)
| ~ part_of(X1,X3)
| ~ part_of(X2,X3)
| ~ end_point(X4,X3)
| ~ incident_c(X4,X1)
| ~ incident_c(X4,X2) ),
i_0_21 ).
cnf(c_0_68,negated_conjecture,
incident_c(esk16_0,esk15_0),
inference(spm,[status(thm)],[c_0_61,c_0_58]) ).
cnf(c_0_69,plain,
( incident_c(X1,X2)
| ~ meet(X1,X2,X3) ),
i_0_32 ).
cnf(c_0_70,plain,
~ incident_c(esk1_1(esk15_0),esk14_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_71,plain,
( incident_c(esk1_1(X1),X2)
| ~ part_of(X1,X2) ),
inference(spm,[status(thm)],[c_0_65,c_0_64]) ).
cnf(c_0_72,plain,
~ incident_c(esk1_1(esk14_0),esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_66]),c_0_64])]) ).
cnf(c_0_73,plain,
( part_of(esk15_0,X1)
| part_of(X1,esk15_0)
| ~ incident_c(esk16_0,X1)
| ~ end_point(esk16_0,X2)
| ~ part_of(esk15_0,X2)
| ~ part_of(X1,X2) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_74,negated_conjecture,
incident_c(esk16_0,esk14_0),
inference(spm,[status(thm)],[c_0_69,c_0_58]) ).
cnf(c_0_75,plain,
~ part_of(esk15_0,esk14_0),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_76,plain,
~ part_of(esk14_0,esk15_0),
inference(spm,[status(thm)],[c_0_72,c_0_71]) ).
cnf(c_0_77,negated_conjecture,
( ~ end_point(esk16_0,X1)
| ~ part_of(esk15_0,X1)
| ~ part_of(esk14_0,X1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]),c_0_76]) ).
cnf(c_0_78,negated_conjecture,
part_of(esk14_0,esk13_0),
i_0_40 ).
cnf(c_0_79,negated_conjecture,
end_point(esk16_0,esk13_0),
i_0_38 ).
cnf(c_0_80,negated_conjecture,
part_of(esk15_0,esk13_0),
i_0_39 ).
cnf(c_0_81,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]),c_0_80])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO094+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jun 17 16:01:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.49/2.26 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 4.49/2.26 # Version: 2.1pre011
% 4.49/2.26 # Preprocessing time : 0.010 s
% 4.49/2.26
% 4.49/2.26 # Proof found!
% 4.49/2.26 # SZS status Theorem
% 4.49/2.26 # SZS output start CNFRefutation
% See solution above
% 4.49/2.26 # Proof object total steps : 40
% 4.49/2.26 # Proof object clause steps : 27
% 4.49/2.26 # Proof object formula steps : 13
% 4.49/2.26 # Proof object conjectures : 14
% 4.49/2.26 # Proof object clause conjectures : 10
% 4.49/2.26 # Proof object formula conjectures : 4
% 4.49/2.26 # Proof object initial clauses used : 13
% 4.49/2.26 # Proof object initial formulas used : 13
% 4.49/2.26 # Proof object generating inferences : 14
% 4.49/2.26 # Proof object simplifying inferences : 9
% 4.49/2.26 # Training examples: 0 positive, 0 negative
% 4.49/2.26 # Parsed axioms : 47
% 4.49/2.26 # Removed by relevancy pruning/SinE : 0
% 4.49/2.26 # Initial clauses : 47
% 4.49/2.26 # Removed in clause preprocessing : 0
% 4.49/2.26 # Initial clauses in saturation : 47
% 4.49/2.26 # Processed clauses : 105
% 4.49/2.26 # ...of these trivial : 0
% 4.49/2.26 # ...subsumed : 3
% 4.49/2.26 # ...remaining for further processing : 102
% 4.49/2.26 # Other redundant clauses eliminated : 3
% 4.49/2.26 # Clauses deleted for lack of memory : 0
% 4.49/2.26 # Backward-subsumed : 0
% 4.49/2.26 # Backward-rewritten : 0
% 4.49/2.26 # Generated clauses : 381
% 4.49/2.26 # ...of the previous two non-trivial : 319
% 4.49/2.26 # Contextual simplify-reflections : 1
% 4.49/2.26 # Paramodulations : 306
% 4.49/2.26 # Factorizations : 68
% 4.49/2.26 # Equation resolutions : 7
% 4.49/2.26 # Propositional unsat checks : 0
% 4.49/2.26 # Propositional unsat check successes : 0
% 4.49/2.26 # Current number of processed clauses : 102
% 4.49/2.26 # Positive orientable unit clauses : 16
% 4.49/2.26 # Positive unorientable unit clauses: 0
% 4.49/2.26 # Negative unit clauses : 6
% 4.49/2.26 # Non-unit-clauses : 80
% 4.49/2.26 # Current number of unprocessed clauses: 260
% 4.49/2.26 # ...number of literals in the above : 1111
% 4.49/2.26 # Current number of archived formulas : 0
% 4.49/2.26 # Current number of archived clauses : 0
% 4.49/2.26 # Clause-clause subsumption calls (NU) : 1043
% 4.49/2.26 # Rec. Clause-clause subsumption calls : 598
% 4.49/2.26 # Non-unit clause-clause subsumptions : 3
% 4.49/2.26 # Unit Clause-clause subsumption calls : 136
% 4.49/2.26 # Rewrite failures with RHS unbound : 0
% 4.49/2.26 # BW rewrite match attempts : 18
% 4.49/2.26 # BW rewrite match successes : 0
% 4.49/2.26 # Condensation attempts : 0
% 4.49/2.26 # Condensation successes : 0
% 4.49/2.26 # Termbank termtop insertions : 6001
% 4.49/2.26
% 4.49/2.26 # -------------------------------------------------
% 4.49/2.26 # User time : 0.013 s
% 4.49/2.26 # System time : 0.002 s
% 4.49/2.26 # Total time : 0.015 s
% 4.49/2.26 # ...preprocessing : 0.010 s
% 4.49/2.26 # ...main loop : 0.006 s
% 4.49/2.26 # Maximum resident set size: 7132 pages
% 4.49/2.26
%------------------------------------------------------------------------------