TSTP Solution File: GEO183+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO183+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:55 EDT 2023
% Result : Theorem 0.23s 0.52s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 54 ( 23 ~; 15 |; 9 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn; 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& ~ distinct_lines(X4,line_connecting(X1,X2)) )
=> ( ~ apart_point_and_line(X1,X4)
& ~ apart_point_and_line(X2,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.CseQYbLMNG/E---3.1_27550.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.CseQYbLMNG/E---3.1_27550.p',ceq2) ).
fof(ci1,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.CseQYbLMNG/E---3.1_27550.p',ci1) ).
fof(ci2,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.CseQYbLMNG/E---3.1_27550.p',ci2) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& ~ distinct_lines(X4,line_connecting(X1,X2)) )
=> ( ~ apart_point_and_line(X1,X4)
& ~ apart_point_and_line(X2,X4) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_5,plain,
! [X25,X26,X27] :
( ~ apart_point_and_line(X25,X26)
| distinct_lines(X26,X27)
| apart_point_and_line(X25,X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])]) ).
fof(c_0_6,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& convergent_lines(esk3_0,esk4_0)
& ~ distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0))
& ( apart_point_and_line(esk1_0,esk3_0)
| apart_point_and_line(esk2_0,esk3_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci1]) ).
cnf(c_0_8,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_9,negated_conjecture,
( apart_point_and_line(esk1_0,esk3_0)
| apart_point_and_line(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X10,X11] :
( ~ distinct_points(X10,X11)
| ~ apart_point_and_line(X10,line_connecting(X10,X11)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
cnf(c_0_11,negated_conjecture,
~ distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( apart_point_and_line(esk2_0,esk3_0)
| apart_point_and_line(esk1_0,X1)
| distinct_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
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,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci2]) ).
cnf(c_0_17,negated_conjecture,
apart_point_and_line(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
fof(c_0_18,plain,
! [X12,X13] :
( ~ distinct_points(X12,X13)
| ~ apart_point_and_line(X13,line_connecting(X12,X13)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
( apart_point_and_line(esk2_0,X1)
| distinct_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_20,plain,
( ~ distinct_points(X1,X2)
| ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : GEO183+1 : TPTP v8.1.2. Released v3.3.0.
% 0.15/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n002.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 07:04:45 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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.CseQYbLMNG/E---3.1_27550.p
% 0.23/0.52 # Version: 3.1pre001
% 0.23/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.52 # Starting sh5l with 300s (1) cores
% 0.23/0.52 # sh5l with pid 27633 completed with status 0
% 0.23/0.52 # Result found by sh5l
% 0.23/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.52 # Starting sh5l with 300s (1) cores
% 0.23/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.52 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.23/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.52 # SAT001_MinMin_p005000_rr_RG with pid 27639 completed with status 0
% 0.23/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.52 # Starting sh5l with 300s (1) cores
% 0.23/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.52 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.23/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.52 # Preprocessing time : 0.001 s
% 0.23/0.52 # Presaturation interreduction done
% 0.23/0.52
% 0.23/0.52 # Proof found!
% 0.23/0.52 # SZS status Theorem
% 0.23/0.52 # SZS output start CNFRefutation
% See solution above
% 0.23/0.52 # Parsed axioms : 15
% 0.23/0.52 # Removed by relevancy pruning/SinE : 0
% 0.23/0.52 # Initial clauses : 18
% 0.23/0.52 # Removed in clause preprocessing : 0
% 0.23/0.52 # Initial clauses in saturation : 18
% 0.23/0.52 # Processed clauses : 56
% 0.23/0.52 # ...of these trivial : 0
% 0.23/0.52 # ...subsumed : 7
% 0.23/0.52 # ...remaining for further processing : 49
% 0.23/0.52 # Other redundant clauses eliminated : 0
% 0.23/0.52 # Clauses deleted for lack of memory : 0
% 0.23/0.52 # Backward-subsumed : 0
% 0.23/0.52 # Backward-rewritten : 6
% 0.23/0.52 # Generated clauses : 42
% 0.23/0.52 # ...of the previous two non-redundant : 37
% 0.23/0.52 # ...aggressively subsumed : 0
% 0.23/0.52 # Contextual simplify-reflections : 0
% 0.23/0.52 # Paramodulations : 40
% 0.23/0.52 # Factorizations : 2
% 0.23/0.52 # NegExts : 0
% 0.23/0.52 # Equation resolutions : 0
% 0.23/0.52 # Total rewrite steps : 12
% 0.23/0.52 # Propositional unsat checks : 0
% 0.23/0.52 # Propositional check models : 0
% 0.23/0.52 # Propositional check unsatisfiable : 0
% 0.23/0.52 # Propositional clauses : 0
% 0.23/0.52 # Propositional clauses after purity: 0
% 0.23/0.52 # Propositional unsat core size : 0
% 0.23/0.52 # Propositional preprocessing time : 0.000
% 0.23/0.52 # Propositional encoding time : 0.000
% 0.23/0.52 # Propositional solver time : 0.000
% 0.23/0.52 # Success case prop preproc time : 0.000
% 0.23/0.52 # Success case prop encoding time : 0.000
% 0.23/0.52 # Success case prop solver time : 0.000
% 0.23/0.52 # Current number of processed clauses : 25
% 0.23/0.52 # Positive orientable unit clauses : 5
% 0.23/0.52 # Positive unorientable unit clauses: 0
% 0.23/0.52 # Negative unit clauses : 4
% 0.23/0.52 # Non-unit-clauses : 16
% 0.23/0.52 # Current number of unprocessed clauses: 15
% 0.23/0.52 # ...number of literals in the above : 61
% 0.23/0.52 # Current number of archived formulas : 0
% 0.23/0.52 # Current number of archived clauses : 24
% 0.23/0.52 # Clause-clause subsumption calls (NU) : 36
% 0.23/0.52 # Rec. Clause-clause subsumption calls : 25
% 0.23/0.52 # Non-unit clause-clause subsumptions : 7
% 0.23/0.52 # Unit Clause-clause subsumption calls : 2
% 0.23/0.52 # Rewrite failures with RHS unbound : 0
% 0.23/0.52 # BW rewrite match attempts : 1
% 0.23/0.52 # BW rewrite match successes : 1
% 0.23/0.52 # Condensation attempts : 0
% 0.23/0.52 # Condensation successes : 0
% 0.23/0.52 # Termbank termtop insertions : 1585
% 0.23/0.52
% 0.23/0.52 # -------------------------------------------------
% 0.23/0.52 # User time : 0.007 s
% 0.23/0.52 # System time : 0.001 s
% 0.23/0.52 # Total time : 0.008 s
% 0.23/0.52 # Maximum resident set size: 1704 pages
% 0.23/0.52
% 0.23/0.52 # -------------------------------------------------
% 0.23/0.52 # User time : 0.009 s
% 0.23/0.52 # System time : 0.002 s
% 0.23/0.52 # Total time : 0.011 s
% 0.23/0.52 # Maximum resident set size: 1688 pages
% 0.23/0.52 % E---3.1 exiting
% 0.23/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------