TSTP Solution File: GEO228+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO228+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:16 EDT 2023
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 51 ( 24 ~; 19 |; 5 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 14 ( 0 sgn; 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X2,X3] :
( ~ convergent_lines(X2,X3)
<=> ( ~ unequally_directed_lines(X2,X3)
| ~ unequally_directed_lines(X2,reverse_line(X3)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.UKvDnATeRP/E---3.1_14544.p',con) ).
fof(con_def,axiom,
! [X2,X3] :
( convergent_lines(X2,X3)
<=> ( unequally_directed_lines(X2,X3)
& unequally_directed_lines(X2,reverse_line(X3)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.UKvDnATeRP/E---3.1_14544.p',con_def) ).
fof(c_0_2,negated_conjecture,
~ ! [X2,X3] :
( ~ convergent_lines(X2,X3)
<=> ( ~ unequally_directed_lines(X2,X3)
| ~ unequally_directed_lines(X2,reverse_line(X3)) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_3,plain,
! [X16,X17] :
( ( unequally_directed_lines(X16,X17)
| ~ convergent_lines(X16,X17) )
& ( unequally_directed_lines(X16,reverse_line(X17))
| ~ convergent_lines(X16,X17) )
& ( ~ unequally_directed_lines(X16,X17)
| ~ unequally_directed_lines(X16,reverse_line(X17))
| convergent_lines(X16,X17) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con_def])])]) ).
fof(c_0_4,negated_conjecture,
( ( unequally_directed_lines(esk1_0,esk2_0)
| convergent_lines(esk1_0,esk2_0) )
& ( unequally_directed_lines(esk1_0,reverse_line(esk2_0))
| convergent_lines(esk1_0,esk2_0) )
& ( ~ convergent_lines(esk1_0,esk2_0)
| ~ unequally_directed_lines(esk1_0,esk2_0)
| ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
cnf(c_0_5,plain,
( unequally_directed_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( unequally_directed_lines(esk1_0,esk2_0)
| convergent_lines(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ~ convergent_lines(esk1_0,esk2_0)
| ~ unequally_directed_lines(esk1_0,esk2_0)
| ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
unequally_directed_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0))
| ~ convergent_lines(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_10,plain,
( convergent_lines(X1,X2)
| ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
( unequally_directed_lines(esk1_0,reverse_line(esk2_0))
| convergent_lines(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
~ unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8])]) ).
cnf(c_0_13,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(sr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO228+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 07:15:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.UKvDnATeRP/E---3.1_14544.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_3 with pid 14626 completed with status 0
% 0.20/0.50 # Result found by new_bool_3
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # SAT001_MinMin_p005000_rr_RG with pid 14629 completed with status 0
% 0.20/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 32
% 0.20/0.50 # Removed by relevancy pruning/SinE : 27
% 0.20/0.50 # Initial clauses : 12
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 12
% 0.20/0.50 # Processed clauses : 23
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 2
% 0.20/0.50 # ...remaining for further processing : 21
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 1
% 0.20/0.50 # Backward-rewritten : 2
% 0.20/0.50 # Generated clauses : 12
% 0.20/0.50 # ...of the previous two non-redundant : 6
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 11
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 4
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 7
% 0.20/0.50 # Positive orientable unit clauses : 2
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 2
% 0.20/0.50 # Non-unit-clauses : 3
% 0.20/0.50 # Current number of unprocessed clauses: 5
% 0.20/0.50 # ...number of literals in the above : 14
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 14
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 15
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 15
% 0.20/0.50 # Non-unit clause-clause subsumptions : 2
% 0.20/0.50 # Unit Clause-clause subsumption calls : 3
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 1
% 0.20/0.50 # BW rewrite match successes : 1
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 1150
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.003 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.005 s
% 0.20/0.50 # Maximum resident set size: 1744 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.009 s
% 0.20/0.50 # Maximum resident set size: 1712 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------