TSTP Solution File: GEO094-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO094-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:33:45 EDT 2023
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of clauses : 40 ( 19 unt; 4 nHn; 37 RR)
% Number of literals : 89 ( 0 equ; 52 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(inner_point_defn_22,axiom,
( ~ inner_point(X1,X2)
| ~ end_point(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Ce5NDCwngA/E---3.1_31439.p',inner_point_defn_22) ).
cnf(c3_37,axiom,
inner_point(ax0_sk8(X1),X1),
file('/export/starexec/sandbox/tmp/tmp.Ce5NDCwngA/E---3.1_31439.p',c3_37) ).
cnf(meet_defn_26,axiom,
( end_point(X4,X2)
| ~ meet(X1,X2,X3)
| ~ incident_c(X4,X2)
| ~ incident_c(X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.Ce5NDCwngA/E---3.1_31439.p',meet_defn_26) ).
cnf(proposition_2_14_3_67,negated_conjecture,
meet(sk17,sk15,sk16),
file('/export/starexec/sandbox/tmp/tmp.Ce5NDCwngA/E---3.1_31439.p',proposition_2_14_3_67) ).
cnf(inner_point_defn_21,axiom,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Ce5NDCwngA/E---3.1_31439.p',inner_point_defn_21) ).
cnf(meet_defn_27,axiom,
( end_point(X4,X3)
| ~ meet(X1,X2,X3)
| ~ incident_c(X4,X2)
| ~ incident_c(X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.Ce5NDCwngA/E---3.1_31439.p',meet_defn_27) ).
cnf(end_point_defn_14,axiom,
( part_of(X3,X4)
| part_of(X4,X3)
| ~ end_point(X1,X2)
| ~ part_of(X3,X2)
| ~ part_of(X4,X2)
| ~ incident_c(X1,X3)
| ~ incident_c(X1,X4) ),
file('/export/starexec/sandbox/tmp/tmp.Ce5NDCwngA/E---3.1_31439.p',end_point_defn_14) ).
cnf(proposition_2_14_3_70,negated_conjecture,
end_point(sk17,sk14),
file('/export/starexec/sandbox/tmp/tmp.Ce5NDCwngA/E---3.1_31439.p',proposition_2_14_3_70) ).
cnf(meet_defn_25,axiom,
( incident_c(X1,X3)
| ~ meet(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.Ce5NDCwngA/E---3.1_31439.p',meet_defn_25) ).
cnf(part_of_defn_1,axiom,
( incident_c(X3,X2)
| ~ part_of(X1,X2)
| ~ incident_c(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.Ce5NDCwngA/E---3.1_31439.p',part_of_defn_1) ).
cnf(proposition_2_14_3_69,negated_conjecture,
part_of(sk16,sk14),
file('/export/starexec/sandbox/tmp/tmp.Ce5NDCwngA/E---3.1_31439.p',proposition_2_14_3_69) ).
cnf(meet_defn_24,axiom,
( incident_c(X1,X2)
| ~ meet(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.Ce5NDCwngA/E---3.1_31439.p',meet_defn_24) ).
cnf(proposition_2_14_3_68,negated_conjecture,
part_of(sk15,sk14),
file('/export/starexec/sandbox/tmp/tmp.Ce5NDCwngA/E---3.1_31439.p',proposition_2_14_3_68) ).
cnf(c_0_13,axiom,
( ~ inner_point(X1,X2)
| ~ end_point(X1,X2) ),
inner_point_defn_22 ).
cnf(c_0_14,axiom,
inner_point(ax0_sk8(X1),X1),
c3_37 ).
cnf(c_0_15,axiom,
( end_point(X4,X2)
| ~ meet(X1,X2,X3)
| ~ incident_c(X4,X2)
| ~ incident_c(X4,X3) ),
meet_defn_26 ).
cnf(c_0_16,negated_conjecture,
meet(sk17,sk15,sk16),
proposition_2_14_3_67 ).
cnf(c_0_17,axiom,
( incident_c(X1,X2)
| ~ inner_point(X1,X2) ),
inner_point_defn_21 ).
cnf(c_0_18,axiom,
( end_point(X4,X3)
| ~ meet(X1,X2,X3)
| ~ incident_c(X4,X2)
| ~ incident_c(X4,X3) ),
meet_defn_27 ).
cnf(c_0_19,axiom,
( part_of(X3,X4)
| part_of(X4,X3)
| ~ end_point(X1,X2)
| ~ part_of(X3,X2)
| ~ part_of(X4,X2)
| ~ incident_c(X1,X3)
| ~ incident_c(X1,X4) ),
end_point_defn_14 ).
cnf(c_0_20,negated_conjecture,
end_point(sk17,sk14),
proposition_2_14_3_70 ).
cnf(c_0_21,axiom,
( incident_c(X1,X3)
| ~ meet(X1,X2,X3) ),
meet_defn_25 ).
cnf(c_0_22,plain,
~ end_point(ax0_sk8(X1),X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_23,negated_conjecture,
( end_point(X1,sk15)
| ~ incident_c(X1,sk16)
| ~ incident_c(X1,sk15) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
incident_c(ax0_sk8(X1),X1),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_25,axiom,
( incident_c(X3,X2)
| ~ part_of(X1,X2)
| ~ incident_c(X3,X1) ),
part_of_defn_1 ).
cnf(c_0_26,negated_conjecture,
( end_point(X1,sk16)
| ~ incident_c(X1,sk16)
| ~ incident_c(X1,sk15) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_27,negated_conjecture,
( part_of(X1,X2)
| part_of(X2,X1)
| ~ incident_c(sk17,X1)
| ~ incident_c(sk17,X2)
| ~ part_of(X1,sk14)
| ~ part_of(X2,sk14) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
incident_c(sk17,sk16),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_29,negated_conjecture,
part_of(sk16,sk14),
proposition_2_14_3_69 ).
cnf(c_0_30,axiom,
( incident_c(X1,X2)
| ~ meet(X1,X2,X3) ),
meet_defn_24 ).
cnf(c_0_31,negated_conjecture,
~ incident_c(ax0_sk8(sk15),sk16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_32,plain,
( incident_c(ax0_sk8(X1),X2)
| ~ part_of(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_33,negated_conjecture,
~ incident_c(ax0_sk8(sk16),sk15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_24])]) ).
cnf(c_0_34,negated_conjecture,
( part_of(X1,sk16)
| part_of(sk16,X1)
| ~ incident_c(sk17,X1)
| ~ part_of(X1,sk14) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_35,negated_conjecture,
incident_c(sk17,sk15),
inference(spm,[status(thm)],[c_0_30,c_0_16]) ).
cnf(c_0_36,negated_conjecture,
part_of(sk15,sk14),
proposition_2_14_3_68 ).
cnf(c_0_37,negated_conjecture,
~ part_of(sk15,sk16),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
~ part_of(sk16,sk15),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO094-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 06:30:03 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Ce5NDCwngA/E---3.1_31439.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 31516 completed with status 0
% 0.20/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHSF-FFMS31-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 737s (1) cores
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 189s (1) cores
% 0.20/0.51 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.20/0.51 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.51 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 31527 completed with status 0
% 0.20/0.51 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHSF-FFMS31-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 737s (1) cores
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 189s (1) cores
% 0.20/0.51 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.20/0.51 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.51 # Preprocessing time : 0.002 s
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 52
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 52
% 0.20/0.51 # Removed in clause preprocessing : 5
% 0.20/0.51 # Initial clauses in saturation : 47
% 0.20/0.51 # Processed clauses : 121
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 7
% 0.20/0.51 # ...remaining for further processing : 114
% 0.20/0.51 # Other redundant clauses eliminated : 3
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 6
% 0.20/0.51 # Backward-rewritten : 2
% 0.20/0.51 # Generated clauses : 380
% 0.20/0.51 # ...of the previous two non-redundant : 340
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 2
% 0.20/0.51 # Paramodulations : 364
% 0.20/0.51 # Factorizations : 9
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 7
% 0.20/0.51 # Total rewrite steps : 34
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 106
% 0.20/0.51 # Positive orientable unit clauses : 14
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 8
% 0.20/0.51 # Non-unit-clauses : 84
% 0.20/0.51 # Current number of unprocessed clauses: 254
% 0.20/0.51 # ...number of literals in the above : 1063
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 8
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 1009
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 532
% 0.20/0.51 # Non-unit clause-clause subsumptions : 7
% 0.20/0.51 # Unit Clause-clause subsumption calls : 211
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 19
% 0.20/0.51 # BW rewrite match successes : 2
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 6284
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.013 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.014 s
% 0.20/0.51 # Maximum resident set size: 1700 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.057 s
% 0.20/0.51 # System time : 0.007 s
% 0.20/0.51 # Total time : 0.064 s
% 0.20/0.51 # Maximum resident set size: 1720 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------