TSTP Solution File: GEO182+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO182+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:34:13 EDT 2023
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 15 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 46 ( 20 ~; 17 |; 2 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 56 ( 3 sgn; 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( apart_point_and_line(X3,line_connecting(X1,X2))
=> apart_point_and_line(X3,line_connecting(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.Q9i69UUWAH/E---3.1_6295.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/sandbox/tmp/tmp.Q9i69UUWAH/E---3.1_6295.p',ceq2) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.Q9i69UUWAH/E---3.1_6295.p',apart2) ).
fof(apart5,axiom,
! [X1,X2,X3] :
( distinct_lines(X1,X2)
=> ( distinct_lines(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.Q9i69UUWAH/E---3.1_6295.p',apart5) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox/tmp/tmp.Q9i69UUWAH/E---3.1_6295.p',cp1) ).
fof(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Q9i69UUWAH/E---3.1_6295.p',p1) ).
fof(cp2,axiom,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.Q9i69UUWAH/E---3.1_6295.p',cp2) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( apart_point_and_line(X3,line_connecting(X1,X2))
=> apart_point_and_line(X3,line_connecting(X2,X1)) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_8,plain,
! [X38,X39,X40] :
( ~ apart_point_and_line(X38,X39)
| distinct_lines(X39,X40)
| apart_point_and_line(X38,X40) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])]) ).
fof(c_0_9,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))
& ~ apart_point_and_line(esk3_0,line_connecting(esk2_0,esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,plain,
! [X1] : ~ distinct_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart2]) ).
fof(c_0_11,plain,
! [X17,X18,X19] :
( ~ distinct_lines(X17,X18)
| distinct_lines(X17,X19)
| distinct_lines(X18,X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])]) ).
cnf(c_0_12,plain,
( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X12] : ~ distinct_lines(X12,X12),
inference(variable_rename,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( distinct_lines(X1,X3)
| distinct_lines(X2,X3)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( apart_point_and_line(esk3_0,X1)
| distinct_lines(line_connecting(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_17,plain,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
inference(fof_simplification,[status(thm)],[cp1]) ).
fof(c_0_18,plain,
! [X44,X45] :
( ~ distinct_lines(X44,X45)
| convergent_lines(X44,X45) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])]) ).
cnf(c_0_19,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( apart_point_and_line(esk3_0,X1)
| distinct_lines(line_connecting(esk1_0,esk2_0),X2)
| distinct_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,plain,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(fof_simplification,[status(thm)],[cp2]) ).
fof(c_0_22,plain,
! [X46,X47] : ~ convergent_lines(parallel_through_point(X47,X46),X47),
inference(variable_rename,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( apart_point_and_line(esk3_0,X1)
| distinct_lines(X1,line_connecting(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_25,plain,
! [X48,X49] : ~ apart_point_and_line(X48,parallel_through_point(X49,X48)),
inference(variable_rename,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( apart_point_and_line(esk3_0,X1)
| convergent_lines(X1,line_connecting(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
apart_point_and_line(esk3_0,parallel_through_point(line_connecting(esk1_0,esk2_0),X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_28,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GEO182+3 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n028.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 06:50:22 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.Q9i69UUWAH/E---3.1_6295.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6372 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FGHNF-FFMF22-SFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.43 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.43 # Starting sh5l with 136s (1) cores
% 0.15/0.43 # SAT001_CO_MinMin_p005000_rr with pid 6376 completed with status 0
% 0.15/0.43 # Result found by SAT001_CO_MinMin_p005000_rr
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FGHNF-FFMF22-SFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 36
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 49
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 49
% 0.15/0.43 # Processed clauses : 176
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 39
% 0.15/0.43 # ...remaining for further processing : 137
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 0
% 0.15/0.43 # Generated clauses : 252
% 0.15/0.43 # ...of the previous two non-redundant : 168
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 0
% 0.15/0.43 # Paramodulations : 196
% 0.15/0.43 # Factorizations : 56
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Total rewrite steps : 76
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 92
% 0.15/0.43 # Positive orientable unit clauses : 12
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 8
% 0.15/0.43 # Non-unit-clauses : 72
% 0.15/0.43 # Current number of unprocessed clauses: 84
% 0.15/0.43 # ...number of literals in the above : 324
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 45
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 1331
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 775
% 0.15/0.43 # Non-unit clause-clause subsumptions : 39
% 0.15/0.43 # Unit Clause-clause subsumption calls : 65
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 0
% 0.15/0.43 # BW rewrite match successes : 0
% 0.15/0.43 # Condensation attempts : 176
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 5902
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.012 s
% 0.15/0.43 # System time : 0.002 s
% 0.15/0.43 # Total time : 0.014 s
% 0.15/0.43 # Maximum resident set size: 1856 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.050 s
% 0.15/0.43 # System time : 0.006 s
% 0.15/0.43 # Total time : 0.055 s
% 0.15/0.43 # Maximum resident set size: 1732 pages
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------