TSTP Solution File: GEO065-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO065-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:20 EDT 2023
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 6 unt; 0 nHn; 10 RR)
% Number of literals : 14 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t1,axiom,
( between(X3,X2,X1)
| ~ between(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.mOmmnTIcES/E---3.1_2413.p',t1) ).
cnf(w_between_u_and_v,hypothesis,
between(u,w,v),
file('/export/starexec/sandbox2/tmp/tmp.mOmmnTIcES/E---3.1_2413.p',w_between_u_and_v) ).
cnf(prove_uvw_colinear,negated_conjecture,
~ colinear(u,v,w),
file('/export/starexec/sandbox2/tmp/tmp.mOmmnTIcES/E---3.1_2413.p',prove_uvw_colinear) ).
cnf(colinearity2,axiom,
( colinear(X3,X1,X2)
| ~ between(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.mOmmnTIcES/E---3.1_2413.p',colinearity2) ).
cnf(c_0_4,axiom,
( between(X3,X2,X1)
| ~ between(X1,X2,X3) ),
t1 ).
cnf(c_0_5,hypothesis,
between(u,w,v),
w_between_u_and_v ).
cnf(c_0_6,negated_conjecture,
~ colinear(u,v,w),
prove_uvw_colinear ).
cnf(c_0_7,axiom,
( colinear(X3,X1,X2)
| ~ between(X1,X2,X3) ),
colinearity2 ).
cnf(c_0_8,hypothesis,
between(v,w,u),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : GEO065-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 06:49:52 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/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.mOmmnTIcES/E---3.1_2413.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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 # new_bool_3 with pid 2496 completed with status 0
% 0.21/0.53 # Result found by new_bool_3
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGUSS-FFMF00-SFFFFFNN
% 0.21/0.53 # partial match(2): FGUSS-FFMF33-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 178s (1) cores
% 0.21/0.53 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 2499 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: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGUSS-FFMF00-SFFFFFNN
% 0.21/0.53 # partial match(2): FGUSS-FFMF33-SFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 178s (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 : 89
% 0.21/0.53 # Removed by relevancy pruning/SinE : 62
% 0.21/0.53 # Initial clauses : 27
% 0.21/0.53 # Removed in clause preprocessing : 1
% 0.21/0.53 # Initial clauses in saturation : 26
% 0.21/0.53 # Processed clauses : 29
% 0.21/0.53 # ...of these trivial : 0
% 0.21/0.53 # ...subsumed : 2
% 0.21/0.53 # ...remaining for further processing : 26
% 0.21/0.53 # Other redundant clauses eliminated : 1
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 0
% 0.21/0.53 # Backward-rewritten : 0
% 0.21/0.53 # Generated clauses : 58
% 0.21/0.53 # ...of the previous two non-redundant : 35
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 57
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 1
% 0.21/0.53 # Total rewrite steps : 13
% 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 : 25
% 0.21/0.53 # Positive orientable unit clauses : 4
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 1
% 0.21/0.53 # Non-unit-clauses : 20
% 0.21/0.53 # Current number of unprocessed clauses: 32
% 0.21/0.53 # ...number of literals in the above : 84
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 0
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 353
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 288
% 0.21/0.53 # Non-unit clause-clause subsumptions : 2
% 0.21/0.53 # Unit Clause-clause subsumption calls : 0
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 4
% 0.21/0.53 # BW rewrite match successes : 0
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 1612
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.005 s
% 0.21/0.53 # System time : 0.001 s
% 0.21/0.53 # Total time : 0.006 s
% 0.21/0.53 # Maximum resident set size: 1812 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.008 s
% 0.21/0.53 # System time : 0.003 s
% 0.21/0.53 # Total time : 0.011 s
% 0.21/0.53 # Maximum resident set size: 1744 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------