TSTP Solution File: GEO197+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO197+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:02 EDT 2023
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 18 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 60 ( 25 ~; 17 |; 11 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 64 ( 6 sgn; 43 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& convergent_lines(X3,X2)
& convergent_lines(X1,X3)
& incident_point_and_line(intersection_point(X1,X2),X3) )
=> incident_point_and_line(intersection_point(X3,X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.oNSIE0xVbe/E---3.1_11341.p',con) ).
fof(a4,axiom,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.oNSIE0xVbe/E---3.1_11341.p',a4) ).
fof(cp2,axiom,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.oNSIE0xVbe/E---3.1_11341.p',cp2) ).
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.oNSIE0xVbe/E---3.1_11341.p',ceq2) ).
fof(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.oNSIE0xVbe/E---3.1_11341.p',p1) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.oNSIE0xVbe/E---3.1_11341.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.oNSIE0xVbe/E---3.1_11341.p',ax6) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.oNSIE0xVbe/E---3.1_11341.p',apart3) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& convergent_lines(X3,X2)
& convergent_lines(X1,X3)
& incident_point_and_line(intersection_point(X1,X2),X3) )
=> incident_point_and_line(intersection_point(X3,X2),X1) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_9,plain,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
inference(fof_simplification,[status(thm)],[a4]) ).
fof(c_0_10,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& convergent_lines(esk3_0,esk2_0)
& convergent_lines(esk1_0,esk3_0)
& incident_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
& ~ incident_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
! [X14,X15] :
( ( ~ incident_point_and_line(X14,X15)
| ~ apart_point_and_line(X14,X15) )
& ( apart_point_and_line(X14,X15)
| incident_point_and_line(X14,X15) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
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,
! [X33,X34,X35] :
( ~ apart_point_and_line(X33,X34)
| distinct_lines(X34,X35)
| apart_point_and_line(X33,X35) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])]) ).
cnf(c_0_14,negated_conjecture,
~ incident_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( apart_point_and_line(X1,X2)
| incident_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X81,X82] : ~ apart_point_and_line(X81,parallel_through_point(X82,X81)),
inference(variable_rename,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
apart_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_19,plain,
! [X56,X57] :
( ~ distinct_lines(X56,X57)
| convergent_lines(X56,X57) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])]) ).
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(intersection_point(esk3_0,esk2_0),X1)
| distinct_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_22,plain,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
inference(fof_simplification,[status(thm)],[cp1]) ).
fof(c_0_23,plain,
! [X23,X24,X25] :
( ~ convergent_lines(X23,X24)
| convergent_lines(X23,X25)
| convergent_lines(X24,X25) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])]) ).
cnf(c_0_24,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
distinct_lines(esk1_0,parallel_through_point(X1,intersection_point(esk3_0,esk2_0))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_26,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
fof(c_0_27,plain,
! [X79,X80] : ~ convergent_lines(parallel_through_point(X80,X79),X80),
inference(variable_rename,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
convergent_lines(esk1_0,parallel_through_point(X1,intersection_point(esk3_0,esk2_0))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_30,plain,
! [X22] : ~ convergent_lines(X22,X22),
inference(variable_rename,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( convergent_lines(parallel_through_point(X1,intersection_point(esk3_0,esk2_0)),X2)
| convergent_lines(esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
convergent_lines(esk1_0,X1),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_33,c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : GEO197+3 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n023.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Oct 3 06:29:37 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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.oNSIE0xVbe/E---3.1_11341.p
% 0.15/0.42 # Version: 3.1pre001
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # new_bool_1 with pid 11421 completed with status 0
% 0.15/0.42 # Result found by new_bool_1
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGHNF-FFMS22-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # SAT001_MinMin_p005000_rr_RG with pid 11424 completed with status 0
% 0.15/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGHNF-FFMS22-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 36
% 0.15/0.42 # Removed by relevancy pruning/SinE : 4
% 0.15/0.42 # Initial clauses : 43
% 0.15/0.42 # Removed in clause preprocessing : 0
% 0.15/0.42 # Initial clauses in saturation : 43
% 0.15/0.42 # Processed clauses : 172
% 0.15/0.42 # ...of these trivial : 0
% 0.15/0.42 # ...subsumed : 32
% 0.15/0.42 # ...remaining for further processing : 140
% 0.15/0.42 # Other redundant clauses eliminated : 0
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 4
% 0.15/0.42 # Backward-rewritten : 15
% 0.15/0.42 # Generated clauses : 288
% 0.15/0.42 # ...of the previous two non-redundant : 245
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 282
% 0.15/0.42 # Factorizations : 6
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 0
% 0.15/0.42 # Total rewrite steps : 51
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 82
% 0.15/0.42 # Positive orientable unit clauses : 21
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 9
% 0.15/0.42 # Non-unit-clauses : 52
% 0.15/0.42 # Current number of unprocessed clauses: 155
% 0.15/0.42 # ...number of literals in the above : 513
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 58
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 536
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 348
% 0.15/0.42 # Non-unit clause-clause subsumptions : 32
% 0.15/0.42 # Unit Clause-clause subsumption calls : 96
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 8
% 0.15/0.42 # BW rewrite match successes : 8
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 5606
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.012 s
% 0.15/0.42 # System time : 0.001 s
% 0.15/0.42 # Total time : 0.013 s
% 0.15/0.42 # Maximum resident set size: 1896 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.014 s
% 0.15/0.42 # System time : 0.002 s
% 0.15/0.42 # Total time : 0.016 s
% 0.15/0.42 # Maximum resident set size: 1732 pages
% 0.15/0.42 % E---3.1 exiting
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------