TSTP Solution File: GEO206+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO206+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:07 EDT 2023
% Result : Theorem 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 12 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 50 ( 23 ~; 19 |; 4 &)
% ( 0 <=>; 4 =>; 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 : 44 ( 2 sgn; 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( ~ apart_point_and_line(X1,X2)
& ~ convergent_lines(X2,X3) )
=> ~ distinct_lines(X2,parallel_through_point(X3,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.kpAve7cHYm/E---3.1_20221.p',con) ).
fof(cup1,axiom,
! [X1,X2,X3] :
( distinct_lines(X2,X3)
=> ( apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kpAve7cHYm/E---3.1_20221.p',cup1) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.kpAve7cHYm/E---3.1_20221.p',cp1) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kpAve7cHYm/E---3.1_20221.p',ax6) ).
fof(cp2,axiom,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.kpAve7cHYm/E---3.1_20221.p',cp2) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ apart_point_and_line(X1,X2)
& ~ convergent_lines(X2,X3) )
=> ~ distinct_lines(X2,parallel_through_point(X3,X1)) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_6,plain,
! [X23,X24,X25] :
( ~ distinct_lines(X24,X25)
| apart_point_and_line(X23,X24)
| apart_point_and_line(X23,X25)
| convergent_lines(X24,X25) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cup1])]) ).
fof(c_0_7,negated_conjecture,
( ~ apart_point_and_line(esk1_0,esk2_0)
& ~ convergent_lines(esk2_0,esk3_0)
& distinct_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
inference(fof_simplification,[status(thm)],[cp1]) ).
fof(c_0_9,plain,
! [X31,X32,X33] :
( ~ convergent_lines(X31,X32)
| convergent_lines(X31,X33)
| convergent_lines(X32,X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])]) ).
cnf(c_0_10,plain,
( apart_point_and_line(X3,X1)
| apart_point_and_line(X3,X2)
| convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
distinct_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(fof_simplification,[status(thm)],[cp2]) ).
fof(c_0_13,plain,
! [X26,X27] : ~ convergent_lines(parallel_through_point(X27,X26),X27),
inference(variable_rename,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0))
| apart_point_and_line(X1,esk2_0)
| convergent_lines(esk2_0,parallel_through_point(esk3_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_16,plain,
! [X28,X29] : ~ apart_point_and_line(X28,parallel_through_point(X29,X28)),
inference(variable_rename,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0))
| apart_point_and_line(X1,esk2_0)
| convergent_lines(parallel_through_point(esk3_0,esk1_0),X2)
| convergent_lines(esk2_0,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
~ convergent_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( apart_point_and_line(X1,parallel_through_point(esk3_0,esk1_0))
| apart_point_and_line(X1,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ apart_point_and_line(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO206+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n026.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:49:44 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.46 Running first-order theorem proving
% 0.21/0.46 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.kpAve7cHYm/E---3.1_20221.p
% 0.21/0.48 # Version: 3.1pre001
% 0.21/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # Starting sh5l with 300s (1) cores
% 0.21/0.48 # new_bool_3 with pid 20301 completed with status 0
% 0.21/0.48 # Result found by new_bool_3
% 0.21/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48 # SAT001_MinMin_p005000_rr_RG with pid 20305 completed with status 0
% 0.21/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48 # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48 # Preprocessing time : 0.001 s
% 0.21/0.48 # Presaturation interreduction done
% 0.21/0.48
% 0.21/0.48 # Proof found!
% 0.21/0.48 # SZS status Theorem
% 0.21/0.48 # SZS output start CNFRefutation
% See solution above
% 0.21/0.48 # Parsed axioms : 18
% 0.21/0.48 # Removed by relevancy pruning/SinE : 4
% 0.21/0.48 # Initial clauses : 16
% 0.21/0.48 # Removed in clause preprocessing : 0
% 0.21/0.48 # Initial clauses in saturation : 16
% 0.21/0.48 # Processed clauses : 62
% 0.21/0.48 # ...of these trivial : 0
% 0.21/0.48 # ...subsumed : 17
% 0.21/0.48 # ...remaining for further processing : 45
% 0.21/0.48 # Other redundant clauses eliminated : 0
% 0.21/0.48 # Clauses deleted for lack of memory : 0
% 0.21/0.48 # Backward-subsumed : 4
% 0.21/0.48 # Backward-rewritten : 0
% 0.21/0.48 # Generated clauses : 117
% 0.21/0.48 # ...of the previous two non-redundant : 108
% 0.21/0.48 # ...aggressively subsumed : 0
% 0.21/0.48 # Contextual simplify-reflections : 0
% 0.21/0.48 # Paramodulations : 95
% 0.21/0.48 # Factorizations : 22
% 0.21/0.48 # NegExts : 0
% 0.21/0.48 # Equation resolutions : 0
% 0.21/0.48 # Total rewrite steps : 8
% 0.21/0.48 # Propositional unsat checks : 0
% 0.21/0.48 # Propositional check models : 0
% 0.21/0.48 # Propositional check unsatisfiable : 0
% 0.21/0.48 # Propositional clauses : 0
% 0.21/0.48 # Propositional clauses after purity: 0
% 0.21/0.48 # Propositional unsat core size : 0
% 0.21/0.48 # Propositional preprocessing time : 0.000
% 0.21/0.48 # Propositional encoding time : 0.000
% 0.21/0.48 # Propositional solver time : 0.000
% 0.21/0.48 # Success case prop preproc time : 0.000
% 0.21/0.48 # Success case prop encoding time : 0.000
% 0.21/0.48 # Success case prop solver time : 0.000
% 0.21/0.48 # Current number of processed clauses : 25
% 0.21/0.48 # Positive orientable unit clauses : 1
% 0.21/0.48 # Positive unorientable unit clauses: 0
% 0.21/0.48 # Negative unit clauses : 7
% 0.21/0.48 # Non-unit-clauses : 17
% 0.21/0.48 # Current number of unprocessed clauses: 76
% 0.21/0.48 # ...number of literals in the above : 401
% 0.21/0.48 # Current number of archived formulas : 0
% 0.21/0.48 # Current number of archived clauses : 20
% 0.21/0.48 # Clause-clause subsumption calls (NU) : 115
% 0.21/0.48 # Rec. Clause-clause subsumption calls : 93
% 0.21/0.48 # Non-unit clause-clause subsumptions : 21
% 0.21/0.48 # Unit Clause-clause subsumption calls : 2
% 0.21/0.48 # Rewrite failures with RHS unbound : 0
% 0.21/0.48 # BW rewrite match attempts : 0
% 0.21/0.48 # BW rewrite match successes : 0
% 0.21/0.48 # Condensation attempts : 0
% 0.21/0.48 # Condensation successes : 0
% 0.21/0.48 # Termbank termtop insertions : 2483
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.006 s
% 0.21/0.48 # System time : 0.004 s
% 0.21/0.48 # Total time : 0.010 s
% 0.21/0.48 # Maximum resident set size: 1760 pages
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.007 s
% 0.21/0.48 # System time : 0.007 s
% 0.21/0.48 # Total time : 0.014 s
% 0.21/0.48 # Maximum resident set size: 1696 pages
% 0.21/0.48 % E---3.1 exiting
% 0.21/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------