TSTP Solution File: GEO009-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO009-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:04 EDT 2023
% Result : Unsatisfiable 1.05s 0.61s
% Output : CNFRefutation 1.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 39 ( 23 unt; 11 nHn; 25 RR)
% Number of literals : 73 ( 20 equ; 21 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-4 aty)
% Number of variables : 71 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t1,axiom,
( between(X3,X2,X1)
| ~ between(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.iAzmQ6uDLt/E---3.1_911.p',t1) ).
cnf(d_between_a_and_e,hypothesis,
between(a,d,e),
file('/export/starexec/sandbox2/tmp/tmp.iAzmQ6uDLt/E---3.1_911.p',d_between_a_and_e) ).
cnf(c_between_a_and_e,hypothesis,
between(a,c,e),
file('/export/starexec/sandbox2/tmp/tmp.iAzmQ6uDLt/E---3.1_911.p',c_between_a_and_e) ).
cnf(b6,axiom,
( between(X1,X3,X4)
| X2 = X3
| ~ between(X1,X2,X3)
| ~ between(X2,X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.iAzmQ6uDLt/E---3.1_911.p',b6) ).
cnf(b5,axiom,
( between(X2,X3,X4)
| ~ between(X1,X2,X3)
| ~ between(X1,X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.iAzmQ6uDLt/E---3.1_911.p',b5) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/tmp/tmp.iAzmQ6uDLt/E---3.1_911.p',segment_construction1) ).
cnf(t7,axiom,
( X2 = X3
| between(X1,X4,X2)
| between(X4,X1,X2)
| ~ between(X1,X2,X3)
| ~ between(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.iAzmQ6uDLt/E---3.1_911.p',t7) ).
cnf(r6,axiom,
X1 = reflection(reflection(X1,X2),X2),
file('/export/starexec/sandbox2/tmp/tmp.iAzmQ6uDLt/E---3.1_911.p',r6) ).
cnf(reflection,axiom,
reflection(X1,X2) = extension(X1,X2,X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.iAzmQ6uDLt/E---3.1_911.p',reflection) ).
cnf(e1,axiom,
X1 = extension(X2,X1,X3,X3),
file('/export/starexec/sandbox2/tmp/tmp.iAzmQ6uDLt/E---3.1_911.p',e1) ).
cnf(c_not_between_a_and_d,hypothesis,
~ between(a,c,d),
file('/export/starexec/sandbox2/tmp/tmp.iAzmQ6uDLt/E---3.1_911.p',c_not_between_a_and_d) ).
cnf(prove_d_between_a_and_c,negated_conjecture,
~ between(a,d,c),
file('/export/starexec/sandbox2/tmp/tmp.iAzmQ6uDLt/E---3.1_911.p',prove_d_between_a_and_c) ).
cnf(t2,axiom,
between(X1,X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.iAzmQ6uDLt/E---3.1_911.p',t2) ).
cnf(c_0_13,axiom,
( between(X3,X2,X1)
| ~ between(X1,X2,X3) ),
t1 ).
cnf(c_0_14,hypothesis,
between(a,d,e),
d_between_a_and_e ).
cnf(c_0_15,hypothesis,
between(a,c,e),
c_between_a_and_e ).
cnf(c_0_16,axiom,
( between(X1,X3,X4)
| X2 = X3
| ~ between(X1,X2,X3)
| ~ between(X2,X3,X4) ),
b6 ).
cnf(c_0_17,hypothesis,
between(e,d,a),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,axiom,
( between(X2,X3,X4)
| ~ between(X1,X2,X3)
| ~ between(X1,X3,X4) ),
b5 ).
cnf(c_0_19,hypothesis,
between(e,c,a),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_20,hypothesis,
( d = a
| between(e,a,X1)
| ~ between(d,a,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_22,axiom,
( X2 = X3
| between(X1,X4,X2)
| between(X4,X1,X2)
| ~ between(X1,X2,X3)
| ~ between(X4,X2,X3) ),
t7 ).
cnf(c_0_23,hypothesis,
( between(c,a,X1)
| ~ between(e,a,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,hypothesis,
( d = a
| between(e,a,extension(d,a,X1,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
X1 = reflection(reflection(X1,X2),X2),
r6 ).
cnf(c_0_26,axiom,
reflection(X1,X2) = extension(X1,X2,X1,X2),
reflection ).
cnf(c_0_27,plain,
( extension(X1,X2,X3,X4) = X2
| between(X5,X1,X2)
| between(X1,X5,X2)
| ~ between(X5,X2,extension(X1,X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_28,hypothesis,
( d = a
| between(c,a,extension(d,a,X1,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
X1 = extension(extension(X1,X2,X1,X2),X2,extension(X1,X2,X1,X2),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26]) ).
cnf(c_0_30,hypothesis,
( extension(d,a,X1,X2) = a
| d = a
| between(d,c,a)
| between(c,d,a) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,axiom,
X1 = extension(X2,X1,X3,X3),
e1 ).
cnf(c_0_32,hypothesis,
( d = a
| between(c,d,a)
| between(d,c,a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_33,hypothesis,
~ between(a,c,d),
c_not_between_a_and_d ).
cnf(c_0_34,hypothesis,
( d = a
| between(c,d,a) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_32]),c_0_33]) ).
cnf(c_0_35,negated_conjecture,
~ between(a,d,c),
prove_d_between_a_and_c ).
cnf(c_0_36,hypothesis,
d = a,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_34]),c_0_35]) ).
cnf(c_0_37,axiom,
between(X1,X1,X2),
t2 ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : GEO009-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 06:23:44 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.iAzmQ6uDLt/E---3.1_911.p
% 1.05/0.61 # Version: 3.1pre001
% 1.05/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.05/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.05/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.05/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.05/0.61 # Starting sh5l with 300s (1) cores
% 1.05/0.61 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1029 completed with status 0
% 1.05/0.61 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.05/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.05/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.05/0.61 # No SInE strategy applied
% 1.05/0.61 # Search class: FGUSM-FFMF33-SFFFFFNN
% 1.05/0.61 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 1.05/0.61 # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 901s (1) cores
% 1.05/0.61 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_S0a with 151s (1) cores
% 1.05/0.61 # Starting new_bool_3 with 151s (1) cores
% 1.05/0.61 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 151s (1) cores
% 1.05/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 146s (1) cores
% 1.05/0.61 # G-E--_207_C18_F1_AE_CS_SP_PI_S0a with pid 1039 completed with status 0
% 1.05/0.61 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_S0a
% 1.05/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.05/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.05/0.61 # No SInE strategy applied
% 1.05/0.61 # Search class: FGUSM-FFMF33-SFFFFFNN
% 1.05/0.61 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 1.05/0.61 # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 901s (1) cores
% 1.05/0.61 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_S0a with 151s (1) cores
% 1.05/0.61 # Preprocessing time : 0.002 s
% 1.05/0.61
% 1.05/0.61 # Proof found!
% 1.05/0.61 # SZS status Unsatisfiable
% 1.05/0.61 # SZS output start CNFRefutation
% See solution above
% 1.05/0.61 # Parsed axioms : 83
% 1.05/0.61 # Removed by relevancy pruning/SinE : 0
% 1.05/0.61 # Initial clauses : 83
% 1.05/0.61 # Removed in clause preprocessing : 3
% 1.05/0.61 # Initial clauses in saturation : 80
% 1.05/0.61 # Processed clauses : 577
% 1.05/0.61 # ...of these trivial : 54
% 1.05/0.61 # ...subsumed : 143
% 1.05/0.61 # ...remaining for further processing : 380
% 1.05/0.61 # Other redundant clauses eliminated : 5
% 1.05/0.61 # Clauses deleted for lack of memory : 0
% 1.05/0.61 # Backward-subsumed : 3
% 1.05/0.61 # Backward-rewritten : 88
% 1.05/0.61 # Generated clauses : 4709
% 1.05/0.61 # ...of the previous two non-redundant : 3721
% 1.05/0.61 # ...aggressively subsumed : 0
% 1.05/0.61 # Contextual simplify-reflections : 0
% 1.05/0.61 # Paramodulations : 4699
% 1.05/0.61 # Factorizations : 0
% 1.05/0.61 # NegExts : 0
% 1.05/0.61 # Equation resolutions : 10
% 1.05/0.61 # Total rewrite steps : 1301
% 1.05/0.61 # Propositional unsat checks : 0
% 1.05/0.61 # Propositional check models : 0
% 1.05/0.61 # Propositional check unsatisfiable : 0
% 1.05/0.61 # Propositional clauses : 0
% 1.05/0.61 # Propositional clauses after purity: 0
% 1.05/0.61 # Propositional unsat core size : 0
% 1.05/0.61 # Propositional preprocessing time : 0.000
% 1.05/0.61 # Propositional encoding time : 0.000
% 1.05/0.61 # Propositional solver time : 0.000
% 1.05/0.61 # Success case prop preproc time : 0.000
% 1.05/0.61 # Success case prop encoding time : 0.000
% 1.05/0.61 # Success case prop solver time : 0.000
% 1.05/0.61 # Current number of processed clauses : 287
% 1.05/0.61 # Positive orientable unit clauses : 46
% 1.05/0.61 # Positive unorientable unit clauses: 0
% 1.05/0.61 # Negative unit clauses : 7
% 1.05/0.61 # Non-unit-clauses : 234
% 1.05/0.61 # Current number of unprocessed clauses: 3188
% 1.05/0.61 # ...number of literals in the above : 10383
% 1.05/0.61 # Current number of archived formulas : 0
% 1.05/0.61 # Current number of archived clauses : 93
% 1.05/0.61 # Clause-clause subsumption calls (NU) : 13728
% 1.05/0.61 # Rec. Clause-clause subsumption calls : 11423
% 1.05/0.61 # Non-unit clause-clause subsumptions : 146
% 1.05/0.61 # Unit Clause-clause subsumption calls : 471
% 1.05/0.61 # Rewrite failures with RHS unbound : 0
% 1.05/0.61 # BW rewrite match attempts : 771
% 1.05/0.61 # BW rewrite match successes : 14
% 1.05/0.61 # Condensation attempts : 0
% 1.05/0.61 # Condensation successes : 0
% 1.05/0.61 # Termbank termtop insertions : 74144
% 1.05/0.61
% 1.05/0.61 # -------------------------------------------------
% 1.05/0.61 # User time : 0.097 s
% 1.05/0.61 # System time : 0.008 s
% 1.05/0.61 # Total time : 0.105 s
% 1.05/0.61 # Maximum resident set size: 1816 pages
% 1.05/0.61
% 1.05/0.61 # -------------------------------------------------
% 1.05/0.61 # User time : 0.499 s
% 1.05/0.61 # System time : 0.026 s
% 1.05/0.61 # Total time : 0.525 s
% 1.05/0.61 # Maximum resident set size: 1740 pages
% 1.05/0.61 % E---3.1 exiting
% 1.05/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------