TSTP Solution File: GEO257+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO257+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:32:25 EDT 2023
% Result : Theorem 408.19s 136.98s
% Output : CNFRefutation 408.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 29 ( 9 ~; 1 |; 15 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 16 ( 2 sgn; 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X2,X1,X4,X5,X7] :
( ( distinct_points(X1,X5)
& distinct_points(X4,X5)
& ~ apart_point_and_line(X5,X2)
& left_apart_point(X7,X2) )
=> ( ( before_on_line(X2,X1,X4)
& before_on_line(X2,X4,X5) )
=> before_on_line(X2,X1,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8BZV5dj1g1/E---3.1_620.p',con) ).
fof(oag10,axiom,
! [X1,X2] :
~ ( left_apart_point(X1,X2)
| left_apart_point(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.8BZV5dj1g1/E---3.1_620.p',oag10) ).
fof(c_0_2,negated_conjecture,
~ ! [X2,X1,X4,X5,X7] :
( ( distinct_points(X1,X5)
& distinct_points(X4,X5)
& ~ apart_point_and_line(X5,X2)
& left_apart_point(X7,X2) )
=> ( ( before_on_line(X2,X1,X4)
& before_on_line(X2,X4,X5) )
=> before_on_line(X2,X1,X5) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_3,negated_conjecture,
( distinct_points(esk2_0,esk4_0)
& distinct_points(esk3_0,esk4_0)
& ~ apart_point_and_line(esk4_0,esk1_0)
& left_apart_point(esk5_0,esk1_0)
& before_on_line(esk1_0,esk2_0,esk3_0)
& before_on_line(esk1_0,esk3_0,esk4_0)
& ~ before_on_line(esk1_0,esk2_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,plain,
! [X16,X17] :
( ~ left_apart_point(X16,X17)
& ~ left_apart_point(X16,reverse_line(X17)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag10])]) ).
cnf(c_0_5,negated_conjecture,
left_apart_point(esk5_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
~ left_apart_point(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO257+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 06:20:42 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.8BZV5dj1g1/E---3.1_620.p
% 408.19/136.98 # Version: 3.1pre001
% 408.19/136.98 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.19/136.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.19/136.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.19/136.98 # Starting new_bool_3 with 300s (1) cores
% 408.19/136.98 # Starting new_bool_1 with 300s (1) cores
% 408.19/136.98 # Starting sh5l with 300s (1) cores
% 408.19/136.98 # new_bool_3 with pid 824 completed with status 0
% 408.19/136.98 # Result found by new_bool_3
% 408.19/136.98 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.19/136.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.19/136.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.19/136.98 # Starting new_bool_3 with 300s (1) cores
% 408.19/136.98 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.19/136.98 # Search class: FGHNF-FFMS21-SFFFFFNN
% 408.19/136.98 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.19/136.98 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.19/136.98 # SAT001_MinMin_p005000_rr_RG with pid 828 completed with status 0
% 408.19/136.98 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.19/136.98 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.19/136.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.19/136.98 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.19/136.98 # Starting new_bool_3 with 300s (1) cores
% 408.19/136.98 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.19/136.98 # Search class: FGHNF-FFMS21-SFFFFFNN
% 408.19/136.98 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.19/136.98 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.19/136.98 # Preprocessing time : 0.002 s
% 408.19/136.98 # Presaturation interreduction done
% 408.19/136.98
% 408.19/136.98 # Proof found!
% 408.19/136.98 # SZS status Theorem
% 408.19/136.98 # SZS output start CNFRefutation
% See solution above
% 408.19/136.98 # Parsed axioms : 32
% 408.19/136.98 # Removed by relevancy pruning/SinE : 16
% 408.19/136.98 # Initial clauses : 36
% 408.19/136.98 # Removed in clause preprocessing : 0
% 408.19/136.98 # Initial clauses in saturation : 36
% 408.19/136.98 # Processed clauses : 6
% 408.19/136.98 # ...of these trivial : 0
% 408.19/136.98 # ...subsumed : 0
% 408.19/136.98 # ...remaining for further processing : 6
% 408.19/136.98 # Other redundant clauses eliminated : 0
% 408.19/136.98 # Clauses deleted for lack of memory : 0
% 408.19/136.98 # Backward-subsumed : 0
% 408.19/136.98 # Backward-rewritten : 0
% 408.19/136.98 # Generated clauses : 1
% 408.19/136.98 # ...of the previous two non-redundant : 0
% 408.19/136.98 # ...aggressively subsumed : 0
% 408.19/136.98 # Contextual simplify-reflections : 0
% 408.19/136.98 # Paramodulations : 0
% 408.19/136.98 # Factorizations : 0
% 408.19/136.98 # NegExts : 0
% 408.19/136.98 # Equation resolutions : 0
% 408.19/136.98 # Total rewrite steps : 0
% 408.19/136.98 # Propositional unsat checks : 0
% 408.19/136.98 # Propositional check models : 0
% 408.19/136.98 # Propositional check unsatisfiable : 0
% 408.19/136.98 # Propositional clauses : 0
% 408.19/136.98 # Propositional clauses after purity: 0
% 408.19/136.98 # Propositional unsat core size : 0
% 408.19/136.98 # Propositional preprocessing time : 0.000
% 408.19/136.98 # Propositional encoding time : 0.000
% 408.19/136.98 # Propositional solver time : 0.000
% 408.19/136.98 # Success case prop preproc time : 0.000
% 408.19/136.98 # Success case prop encoding time : 0.000
% 408.19/136.98 # Success case prop solver time : 0.000
% 408.19/136.98 # Current number of processed clauses : 5
% 408.19/136.98 # Positive orientable unit clauses : 2
% 408.19/136.98 # Positive unorientable unit clauses: 0
% 408.19/136.98 # Negative unit clauses : 3
% 408.19/136.98 # Non-unit-clauses : 0
% 408.19/136.98 # Current number of unprocessed clauses: 30
% 408.19/136.98 # ...number of literals in the above : 74
% 408.19/136.98 # Current number of archived formulas : 0
% 408.19/136.98 # Current number of archived clauses : 1
% 408.19/136.98 # Clause-clause subsumption calls (NU) : 0
% 408.19/136.98 # Rec. Clause-clause subsumption calls : 0
% 408.19/136.98 # Non-unit clause-clause subsumptions : 0
% 408.19/136.98 # Unit Clause-clause subsumption calls : 0
% 408.19/136.98 # Rewrite failures with RHS unbound : 0
% 408.19/136.98 # BW rewrite match attempts : 0
% 408.19/136.98 # BW rewrite match successes : 0
% 408.19/136.98 # Condensation attempts : 0
% 408.19/136.98 # Condensation successes : 0
% 408.19/136.98 # Termbank termtop insertions : 1832
% 408.19/136.98
% 408.19/136.98 # -------------------------------------------------
% 408.19/136.98 # User time : 0.003 s
% 408.19/136.98 # System time : 0.004 s
% 408.19/136.98 # Total time : 0.007 s
% 408.19/136.98 # Maximum resident set size: 1852 pages
% 408.19/136.98
% 408.19/136.98 # -------------------------------------------------
% 408.19/136.98 # User time : 0.005 s
% 408.19/136.98 # System time : 0.006 s
% 408.19/136.98 # Total time : 0.011 s
% 408.19/136.98 # Maximum resident set size: 1712 pages
% 408.19/136.98 % E---3.1 exiting
% 408.19/136.98 % E---3.1 exiting
%------------------------------------------------------------------------------