TSTP Solution File: GEO002-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GEO002-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:43:44 EDT 2024
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 26 ( 12 unt; 0 nHn; 17 RR)
% Number of literals : 47 ( 10 equ; 24 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-5 aty)
% Number of variables : 77 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.KnN8ncuufN/E---3.1_27267.p',identity_for_equidistance) ).
cnf(identity_for_betweeness,axiom,
( X1 = X2
| ~ between(X1,X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.KnN8ncuufN/E---3.1_27267.p',identity_for_betweeness) ).
cnf(inner_pasch2,axiom,
( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.KnN8ncuufN/E---3.1_27267.p',inner_pasch2) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox2/tmp/tmp.KnN8ncuufN/E---3.1_27267.p',segment_construction2) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/tmp/tmp.KnN8ncuufN/E---3.1_27267.p',segment_construction1) ).
cnf(inner_pasch1,axiom,
( between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.KnN8ncuufN/E---3.1_27267.p',inner_pasch1) ).
cnf(prove_a_between_a_and_b,negated_conjecture,
~ between(a,a,b),
file('/export/starexec/sandbox2/tmp/tmp.KnN8ncuufN/E---3.1_27267.p',prove_a_between_a_and_b) ).
cnf(c_0_7,plain,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
inference(fof_simplification,[status(thm)],[identity_for_equidistance]) ).
cnf(c_0_8,plain,
( X1 = X2
| ~ between(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[identity_for_betweeness]) ).
cnf(c_0_9,plain,
( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
inference(fof_simplification,[status(thm)],[inner_pasch2]) ).
cnf(c_0_10,plain,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
c_0_7 ).
cnf(c_0_11,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_12,plain,
( X1 = X2
| ~ between(X1,X2,X1) ),
c_0_8 ).
cnf(c_0_13,plain,
( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
c_0_9 ).
cnf(c_0_14,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_15,plain,
extension(X1,X2,X3,X3) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( inner_pasch(X1,X2,X3,X1,X4) = X1
| ~ between(X4,X1,X3)
| ~ between(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
between(X1,X2,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
inference(fof_simplification,[status(thm)],[inner_pasch1]) ).
cnf(c_0_19,plain,
( inner_pasch(X1,X2,X1,X1,X3) = X1
| ~ between(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
~ between(a,a,b),
inference(fof_simplification,[status(thm)],[prove_a_between_a_and_b]) ).
cnf(c_0_21,plain,
( between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
c_0_18 ).
cnf(c_0_22,plain,
inner_pasch(X1,X1,X1,X1,X2) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
~ between(a,a,b),
c_0_20 ).
cnf(c_0_24,plain,
between(X1,X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17]),c_0_17])]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO002-2 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 18:37:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.51 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.KnN8ncuufN/E---3.1_27267.p
% 0.21/0.53 # Version: 3.1.0
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27388 completed with status 0
% 0.21/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGUSS-FFMF33-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.53 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.21/0.53 # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.21/0.53 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 27393 completed with status 0
% 0.21/0.53 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGUSS-FFMF33-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 0.21/0.53 # Preprocessing time : 0.002 s
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 19
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 19
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 19
% 0.21/0.53 # Processed clauses : 33
% 0.21/0.53 # ...of these trivial : 0
% 0.21/0.53 # ...subsumed : 1
% 0.21/0.53 # ...remaining for further processing : 32
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 0
% 0.21/0.53 # Backward-rewritten : 1
% 0.21/0.53 # Generated clauses : 60
% 0.21/0.53 # ...of the previous two non-redundant : 45
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 60
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 20
% 0.21/0.53 # ...of those cached : 9
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 31
% 0.21/0.53 # Positive orientable unit clauses : 9
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 3
% 0.21/0.53 # Non-unit-clauses : 19
% 0.21/0.53 # Current number of unprocessed clauses: 31
% 0.21/0.53 # ...number of literals in the above : 155
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 1
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 170
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 84
% 0.21/0.53 # Non-unit clause-clause subsumptions : 1
% 0.21/0.53 # Unit Clause-clause subsumption calls : 31
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 121
% 0.21/0.53 # BW rewrite match successes : 1
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 1269
% 0.21/0.53 # Search garbage collected termcells : 75
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.010 s
% 0.21/0.53 # System time : 0.001 s
% 0.21/0.53 # Total time : 0.011 s
% 0.21/0.53 # Maximum resident set size: 1656 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.035 s
% 0.21/0.53 # System time : 0.011 s
% 0.21/0.53 # Total time : 0.045 s
% 0.21/0.53 # Maximum resident set size: 1708 pages
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------