TSTP Solution File: GEO269+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO269+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : Sat May 4 07:42:43 EDT 2024
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 13 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 60 ( 28 ~; 21 |; 5 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 48 ( 2 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X4] : equally_directed_opposite_lines(X4,reverse_line(X4)),
file('/export/starexec/sandbox2/tmp/tmp.oAEkwbXSFo/E---3.1_30651.p',con) ).
fof(a5_defns,axiom,
! [X1,X2] :
( equally_directed_opposite_lines(X1,X2)
<=> ~ unequally_directed_opposite_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.oAEkwbXSFo/E---3.1_30651.p',a5_defns) ).
fof(ax9_basics,axiom,
! [X4,X5] :
( ( unequally_directed_lines(X4,X5)
& unequally_directed_lines(X4,reverse_line(X5)) )
=> ( left_convergent_lines(X4,X5)
| left_convergent_lines(X4,reverse_line(X5)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oAEkwbXSFo/E---3.1_30651.p',ax9_basics) ).
fof(ax11_basics,axiom,
! [X4,X5] :
~ ( left_convergent_lines(X4,X5)
| left_convergent_lines(X4,reverse_line(X5)) ),
file('/export/starexec/sandbox2/tmp/tmp.oAEkwbXSFo/E---3.1_30651.p',ax11_basics) ).
fof(a1_defns,axiom,
! [X1,X2] :
( unequally_directed_opposite_lines(X1,X2)
<=> unequally_directed_lines(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.oAEkwbXSFo/E---3.1_30651.p',a1_defns) ).
fof(a4_defns,axiom,
! [X1,X2] :
( equally_directed_lines(X1,X2)
<=> ~ unequally_directed_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.oAEkwbXSFo/E---3.1_30651.p',a4_defns) ).
fof(ax5_basics,axiom,
! [X4] : equally_directed_lines(X4,X4),
file('/export/starexec/sandbox2/tmp/tmp.oAEkwbXSFo/E---3.1_30651.p',ax5_basics) ).
fof(ax8_basics,axiom,
! [X4,X5] :
( unequally_directed_lines(X4,X5)
| unequally_directed_lines(X4,reverse_line(X5)) ),
file('/export/starexec/sandbox2/tmp/tmp.oAEkwbXSFo/E---3.1_30651.p',ax8_basics) ).
fof(c_0_8,negated_conjecture,
~ ! [X4] : equally_directed_opposite_lines(X4,reverse_line(X4)),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_9,plain,
! [X1,X2] :
( equally_directed_opposite_lines(X1,X2)
<=> ~ unequally_directed_opposite_lines(X1,X2) ),
inference(fof_simplification,[status(thm)],[a5_defns]) ).
fof(c_0_10,negated_conjecture,
~ equally_directed_opposite_lines(esk1_0,reverse_line(esk1_0)),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_11,plain,
! [X10,X11] :
( ( ~ equally_directed_opposite_lines(X10,X11)
| ~ unequally_directed_opposite_lines(X10,X11) )
& ( unequally_directed_opposite_lines(X10,X11)
| equally_directed_opposite_lines(X10,X11) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,plain,
! [X17,X18] :
( ~ unequally_directed_lines(X17,X18)
| ~ unequally_directed_lines(X17,reverse_line(X18))
| left_convergent_lines(X17,X18)
| left_convergent_lines(X17,reverse_line(X18)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax9_basics])])]) ).
fof(c_0_13,plain,
! [X21,X22] :
( ~ left_convergent_lines(X21,X22)
& ~ left_convergent_lines(X21,reverse_line(X22)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11_basics])])]) ).
fof(c_0_14,plain,
! [X34,X35] :
( ( ~ unequally_directed_opposite_lines(X34,X35)
| unequally_directed_lines(X34,reverse_line(X35)) )
& ( ~ unequally_directed_lines(X34,reverse_line(X35))
| unequally_directed_opposite_lines(X34,X35) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_defns])])]) ).
cnf(c_0_15,negated_conjecture,
~ equally_directed_opposite_lines(esk1_0,reverse_line(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( unequally_directed_opposite_lines(X1,X2)
| equally_directed_opposite_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X1,X2] :
( equally_directed_lines(X1,X2)
<=> ~ unequally_directed_lines(X1,X2) ),
inference(fof_simplification,[status(thm)],[a4_defns]) ).
cnf(c_0_18,plain,
( left_convergent_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_opposite_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
unequally_directed_opposite_lines(esk1_0,reverse_line(esk1_0)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_22,plain,
! [X38,X39] :
( ( ~ equally_directed_lines(X38,X39)
| ~ unequally_directed_lines(X38,X39) )
& ( unequally_directed_lines(X38,X39)
| equally_directed_lines(X38,X39) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
fof(c_0_23,plain,
! [X71] : equally_directed_lines(X71,X71),
inference(variable_rename,[status(thm)],[ax5_basics]) ).
cnf(c_0_24,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_18,c_0_19]),c_0_19]) ).
cnf(c_0_25,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(reverse_line(esk1_0))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_26,plain,
! [X15,X16] :
( unequally_directed_lines(X15,X16)
| unequally_directed_lines(X15,reverse_line(X16)) ),
inference(variable_rename,[status(thm)],[ax8_basics]) ).
cnf(c_0_27,plain,
( ~ equally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
equally_directed_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
~ unequally_directed_lines(esk1_0,reverse_line(esk1_0)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
~ unequally_directed_lines(X1,X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO269+3 : TPTP v8.1.2. Released v4.0.0.
% 0.15/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n010.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 : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 18:27:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.oAEkwbXSFo/E---3.1_30651.p
% 0.21/0.53 # Version: 3.1.0
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # sh5l with pid 30799 completed with status 0
% 0.21/0.53 # Result found by sh5l
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.53 # Search class: FGHNS-FFMF21-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # SAT001_MinMin_p005000_rr_RG with pid 30802 completed with status 0
% 0.21/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.53 # Search class: FGHNS-FFMF21-SFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.53 # Preprocessing time : 0.003 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 37
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 67
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 67
% 0.21/0.53 # Processed clauses : 100
% 0.21/0.53 # ...of these trivial : 0
% 0.21/0.53 # ...subsumed : 21
% 0.21/0.53 # ...remaining for further processing : 79
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 4
% 0.21/0.53 # Backward-rewritten : 0
% 0.21/0.53 # Generated clauses : 14
% 0.21/0.53 # ...of the previous two non-redundant : 5
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 14
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 0
% 0.21/0.53 # ...of those cached : 0
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 33
% 0.21/0.53 # Positive orientable unit clauses : 4
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 13
% 0.21/0.53 # Non-unit-clauses : 16
% 0.21/0.53 # Current number of unprocessed clauses: 14
% 0.21/0.53 # ...number of literals in the above : 43
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 46
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 259
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 225
% 0.21/0.53 # Non-unit clause-clause subsumptions : 5
% 0.21/0.53 # Unit Clause-clause subsumption calls : 118
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 0
% 0.21/0.53 # BW rewrite match successes : 0
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 4247
% 0.21/0.53 # Search garbage collected termcells : 718
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.015 s
% 0.21/0.53 # System time : 0.002 s
% 0.21/0.53 # Total time : 0.017 s
% 0.21/0.53 # Maximum resident set size: 1896 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.017 s
% 0.21/0.53 # System time : 0.005 s
% 0.21/0.53 # Total time : 0.022 s
% 0.21/0.53 # Maximum resident set size: 1740 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.53 % E exiting
%------------------------------------------------------------------------------