TSTP Solution File: GEO224+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GEO224+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:01:32 EDT 2024
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 9 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 84 ( 39 ~; 27 |; 10 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 3 sgn 35 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2] :
( ( point(X1)
& line(X2) )
=> ? [X3] :
( point(X3)
& incident_point_and_line(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(a4,axiom,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',a4) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci4) ).
fof(int1,axiom,
! [X6,X7] :
( ( line(X6)
& line(X7)
& convergent_lines(X6,X7) )
=> point(intersection_point(X6,X7)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+5.ax',int1) ).
fof(ooc1,axiom,
! [X9,X6] : ~ unorthogonal_lines(orthogonal_through_point(X6,X9),X6),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',ooc1) ).
fof(orth1,axiom,
! [X6,X9] :
( ( line(X6)
& point(X9) )
=> line(orthogonal_through_point(X6,X9)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+5.ax',orth1) ).
fof(occu1,axiom,
! [X6,X7] :
( convergent_lines(X6,X7)
| unorthogonal_lines(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',occu1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] :
( ( point(X1)
& line(X2) )
=> ? [X3] :
( point(X3)
& incident_point_and_line(X3,X2) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_8,plain,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
inference(fof_simplification,[status(thm)],[a4]) ).
fof(c_0_9,negated_conjecture,
! [X13] :
( point(esk1_0)
& line(esk2_0)
& ( ~ point(X13)
| ~ incident_point_and_line(X13,esk2_0) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
fof(c_0_10,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(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[ci4]) ).
cnf(c_0_12,negated_conjecture,
( ~ point(X1)
| ~ incident_point_and_line(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( apart_point_and_line(X1,X2)
| incident_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X18,X19] :
( ~ line(X18)
| ~ line(X19)
| ~ convergent_lines(X18,X19)
| point(intersection_point(X18,X19)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int1])])]) ).
fof(c_0_15,plain,
! [X30,X31] :
( ~ convergent_lines(X30,X31)
| ~ apart_point_and_line(intersection_point(X30,X31),X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_16,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| ~ point(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( point(intersection_point(X1,X2))
| ~ line(X1)
| ~ line(X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X9,X6] : ~ unorthogonal_lines(orthogonal_through_point(X6,X9),X6),
inference(fof_simplification,[status(thm)],[ooc1]) ).
cnf(c_0_19,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( apart_point_and_line(intersection_point(X1,X2),esk2_0)
| ~ line(X2)
| ~ line(X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
line(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_22,plain,
! [X22,X23] :
( ~ line(X22)
| ~ point(X23)
| line(orthogonal_through_point(X22,X23)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[orth1])])]) ).
fof(c_0_23,plain,
! [X81,X82] : ~ unorthogonal_lines(orthogonal_through_point(X82,X81),X82),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_18])]) ).
fof(c_0_24,plain,
! [X68,X69] :
( convergent_lines(X68,X69)
| unorthogonal_lines(X68,X69) ),
inference(variable_rename,[status(thm)],[occu1]) ).
cnf(c_0_25,negated_conjecture,
( ~ line(X1)
| ~ convergent_lines(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_26,plain,
( line(orthogonal_through_point(X1,X2))
| ~ line(X1)
| ~ point(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
~ unorthogonal_lines(orthogonal_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( ~ line(X1)
| ~ point(X2)
| ~ convergent_lines(orthogonal_through_point(X1,X2),esk2_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
convergent_lines(orthogonal_through_point(X1,X2),X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
point(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,negated_conjecture,
~ point(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_31,c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : GEO224+3 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28 % CPULimit : 300
% 0.10/0.28 % WCLimit : 300
% 0.10/0.28 % DateTime : Sun May 19 13:33:38 EDT 2024
% 0.10/0.28 % CPUTime :
% 0.13/0.38 Running first-order model finding
% 0.13/0.38 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.39 # Version: 3.1.0
% 0.13/0.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.39 # Starting sh5l with 300s (1) cores
% 0.13/0.39 # sh5l with pid 19033 completed with status 0
% 0.13/0.39 # Result found by sh5l
% 0.13/0.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.39 # Starting sh5l with 300s (1) cores
% 0.13/0.39 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.39 # Search class: FGHNF-FFMF22-SFFFFFNN
% 0.13/0.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.39 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.13/0.39 # SAT001_CO_MinMin_p005000_rr with pid 19049 completed with status 0
% 0.13/0.39 # Result found by SAT001_CO_MinMin_p005000_rr
% 0.13/0.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.39 # Starting sh5l with 300s (1) cores
% 0.13/0.39 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.39 # Search class: FGHNF-FFMF22-SFFFFFNN
% 0.13/0.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.39 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.13/0.39 # Preprocessing time : 0.001 s
% 0.13/0.39 # Presaturation interreduction done
% 0.13/0.39
% 0.13/0.39 # Proof found!
% 0.13/0.39 # SZS status Theorem
% 0.13/0.39 # SZS output start CNFRefutation
% See solution above
% 0.13/0.39 # Parsed axioms : 36
% 0.13/0.39 # Removed by relevancy pruning/SinE : 4
% 0.13/0.39 # Initial clauses : 41
% 0.13/0.39 # Removed in clause preprocessing : 0
% 0.13/0.39 # Initial clauses in saturation : 41
% 0.13/0.39 # Processed clauses : 77
% 0.13/0.39 # ...of these trivial : 0
% 0.13/0.39 # ...subsumed : 6
% 0.13/0.39 # ...remaining for further processing : 71
% 0.13/0.39 # Other redundant clauses eliminated : 0
% 0.13/0.39 # Clauses deleted for lack of memory : 0
% 0.13/0.39 # Backward-subsumed : 8
% 0.13/0.39 # Backward-rewritten : 0
% 0.13/0.39 # Generated clauses : 20
% 0.13/0.39 # ...of the previous two non-redundant : 17
% 0.13/0.39 # ...aggressively subsumed : 0
% 0.13/0.39 # Contextual simplify-reflections : 0
% 0.13/0.39 # Paramodulations : 19
% 0.13/0.39 # Factorizations : 0
% 0.13/0.39 # NegExts : 0
% 0.13/0.39 # Equation resolutions : 0
% 0.13/0.39 # Disequality decompositions : 0
% 0.13/0.39 # Total rewrite steps : 3
% 0.13/0.39 # ...of those cached : 2
% 0.13/0.39 # Propositional unsat checks : 0
% 0.13/0.39 # Propositional check models : 0
% 0.13/0.39 # Propositional check unsatisfiable : 0
% 0.13/0.39 # Propositional clauses : 0
% 0.13/0.39 # Propositional clauses after purity: 0
% 0.13/0.39 # Propositional unsat core size : 0
% 0.13/0.39 # Propositional preprocessing time : 0.000
% 0.13/0.39 # Propositional encoding time : 0.000
% 0.13/0.39 # Propositional solver time : 0.000
% 0.13/0.39 # Success case prop preproc time : 0.000
% 0.13/0.39 # Success case prop encoding time : 0.000
% 0.13/0.39 # Success case prop solver time : 0.000
% 0.13/0.39 # Current number of processed clauses : 25
% 0.13/0.39 # Positive orientable unit clauses : 3
% 0.13/0.39 # Positive unorientable unit clauses: 0
% 0.13/0.39 # Negative unit clauses : 8
% 0.13/0.39 # Non-unit-clauses : 14
% 0.13/0.39 # Current number of unprocessed clauses: 18
% 0.13/0.39 # ...number of literals in the above : 68
% 0.13/0.39 # Current number of archived formulas : 0
% 0.13/0.39 # Current number of archived clauses : 46
% 0.13/0.39 # Clause-clause subsumption calls (NU) : 173
% 0.13/0.39 # Rec. Clause-clause subsumption calls : 106
% 0.13/0.39 # Non-unit clause-clause subsumptions : 4
% 0.13/0.39 # Unit Clause-clause subsumption calls : 20
% 0.13/0.39 # Rewrite failures with RHS unbound : 0
% 0.13/0.39 # BW rewrite match attempts : 0
% 0.13/0.39 # BW rewrite match successes : 0
% 0.13/0.39 # Condensation attempts : 77
% 0.13/0.39 # Condensation successes : 0
% 0.13/0.39 # Termbank termtop insertions : 3417
% 0.13/0.39 # Search garbage collected termcells : 473
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.006 s
% 0.13/0.39 # System time : 0.003 s
% 0.13/0.39 # Total time : 0.008 s
% 0.13/0.39 # Maximum resident set size: 1876 pages
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.006 s
% 0.13/0.39 # System time : 0.005 s
% 0.13/0.39 # Total time : 0.011 s
% 0.13/0.39 # Maximum resident set size: 1760 pages
% 0.13/0.39 % E---3.1 exiting
%------------------------------------------------------------------------------