TSTP Solution File: GEO179+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO179+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:53 EDT 2023
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 10 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 51 ( 20 ~; 18 |; 8 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn; 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( distinct_points(X1,X2)
& apart_point_and_line(X3,line_connecting(X1,X2)) )
=> ( distinct_lines(line_connecting(X1,X2),line_connecting(X3,X1))
& distinct_lines(line_connecting(X1,X2),line_connecting(X3,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Zl4NHfqINN/E---3.1_18261.p',con) ).
fof(ceq2,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Zl4NHfqINN/E---3.1_18261.p',ceq2) ).
fof(con1,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( apart_point_and_line(X3,line_connecting(X1,X2))
=> ( distinct_points(X3,X1)
& distinct_points(X3,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Zl4NHfqINN/E---3.1_18261.p',con1) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.Zl4NHfqINN/E---3.1_18261.p',apart1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( distinct_points(X1,X2)
& apart_point_and_line(X3,line_connecting(X1,X2)) )
=> ( distinct_lines(line_connecting(X1,X2),line_connecting(X3,X1))
& distinct_lines(line_connecting(X1,X2),line_connecting(X3,X2)) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_5,plain,
! [X17,X18,X19] :
( ~ apart_point_and_line(X17,X18)
| distinct_lines(X18,X19)
| apart_point_and_line(X17,X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])]) ).
fof(c_0_6,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))
& ( ~ distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_0,esk1_0))
| ~ distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_0,esk2_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,plain,
( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( ~ distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_0,esk1_0))
| ~ distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( apart_point_and_line(esk3_0,X1)
| distinct_lines(line_connecting(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_11,plain,
! [X22,X23,X24] :
( ( distinct_points(X24,X22)
| ~ apart_point_and_line(X24,line_connecting(X22,X23))
| ~ distinct_points(X22,X23) )
& ( distinct_points(X24,X23)
| ~ apart_point_and_line(X24,line_connecting(X22,X23))
| ~ distinct_points(X22,X23) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con1])])]) ).
fof(c_0_12,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
cnf(c_0_13,negated_conjecture,
( apart_point_and_line(esk3_0,line_connecting(esk3_0,esk1_0))
| ~ distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk3_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X2,X3))
| ~ distinct_points(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
distinct_points(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_16,plain,
! [X28] : ~ distinct_points(X28,X28),
inference(variable_rename,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk3_0,line_connecting(esk3_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_18,negated_conjecture,
distinct_points(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_8]),c_0_15])]) ).
cnf(c_0_19,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X3,X2))
| ~ distinct_points(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
distinct_points(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_8]),c_0_15])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_21]),c_0_22])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : GEO179+2 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n007.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 06:18:40 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.Zl4NHfqINN/E---3.1_18261.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # new_bool_1 with pid 18341 completed with status 0
% 0.16/0.44 # Result found by new_bool_1
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # SAT001_MinMin_p005000_rr_RG with pid 18347 completed with status 0
% 0.16/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.44 # Search class: FGHNF-FFSF22-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 13
% 0.16/0.44 # Removed by relevancy pruning/SinE : 1
% 0.16/0.44 # Initial clauses : 15
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 15
% 0.16/0.44 # Processed clauses : 48
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 3
% 0.16/0.44 # ...remaining for further processing : 45
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 1
% 0.16/0.44 # Generated clauses : 39
% 0.16/0.44 # ...of the previous two non-redundant : 33
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 39
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Total rewrite steps : 14
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 29
% 0.16/0.44 # Positive orientable unit clauses : 8
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 3
% 0.16/0.44 # Non-unit-clauses : 18
% 0.16/0.44 # Current number of unprocessed clauses: 13
% 0.16/0.44 # ...number of literals in the above : 42
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 16
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 27
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 27
% 0.16/0.44 # Non-unit clause-clause subsumptions : 3
% 0.16/0.44 # Unit Clause-clause subsumption calls : 17
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 1
% 0.16/0.44 # BW rewrite match successes : 1
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 1432
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.005 s
% 0.16/0.44 # System time : 0.001 s
% 0.16/0.44 # Total time : 0.006 s
% 0.16/0.44 # Maximum resident set size: 1764 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.007 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.009 s
% 0.16/0.44 # Maximum resident set size: 1688 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------