TSTP Solution File: GEO251+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO251+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:23 EDT 2023
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 4 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 20 ( 10 ~; 4 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 4 sgn; 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X3,X6,X4] :
( right_apart_point(X6,parallel_through_point(X4,X3))
=> left_apart_point(X3,parallel_through_point(X4,X6)) ),
file('/export/starexec/sandbox2/tmp/tmp.JRYatHOC6z/E---3.1_3347.p',con) ).
fof(a2_defns,axiom,
! [X1,X2] :
( right_apart_point(X1,X2)
<=> left_apart_point(X1,reverse_line(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.JRYatHOC6z/E---3.1_3347.p',a2_defns) ).
fof(ax10_basics,axiom,
! [X3,X4] :
~ ( left_apart_point(X3,X4)
| left_apart_point(X3,reverse_line(X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.JRYatHOC6z/E---3.1_3347.p',ax10_basics) ).
fof(c_0_3,negated_conjecture,
~ ! [X3,X6,X4] :
( right_apart_point(X6,parallel_through_point(X4,X3))
=> left_apart_point(X3,parallel_through_point(X4,X6)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_4,plain,
! [X23,X24] :
( ( ~ right_apart_point(X23,X24)
| left_apart_point(X23,reverse_line(X24)) )
& ( ~ left_apart_point(X23,reverse_line(X24))
| right_apart_point(X23,X24) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a2_defns])]) ).
fof(c_0_5,plain,
! [X12,X13] :
( ~ left_apart_point(X12,X13)
& ~ left_apart_point(X12,reverse_line(X13)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax10_basics])]) ).
fof(c_0_6,negated_conjecture,
( right_apart_point(esk2_0,parallel_through_point(esk3_0,esk1_0))
& ~ left_apart_point(esk1_0,parallel_through_point(esk3_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_7,plain,
( left_apart_point(X1,reverse_line(X2))
| ~ right_apart_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
~ left_apart_point(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
right_apart_point(esk2_0,parallel_through_point(esk3_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
~ right_apart_point(X1,X2),
inference(sr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.14 % Problem : GEO251+3 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.15 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n006.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Tue Oct 3 06:48:25 EDT 2023
% 0.13/0.37 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/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.JRYatHOC6z/E---3.1_3347.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_3 with pid 3433 completed with status 0
% 0.20/0.51 # Result found by new_bool_3
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHNS-FFMF21-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 3436 completed with status 0
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHNS-FFMF21-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 37
% 0.20/0.51 # Removed by relevancy pruning/SinE : 15
% 0.20/0.51 # Initial clauses : 33
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 33
% 0.20/0.51 # Processed clauses : 13
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 2
% 0.20/0.51 # ...remaining for further processing : 11
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 1
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 1
% 0.20/0.51 # ...of the previous two non-redundant : 0
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 0
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Total rewrite steps : 0
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 9
% 0.20/0.52 # Positive orientable unit clauses : 2
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 4
% 0.20/0.52 # Non-unit-clauses : 3
% 0.20/0.52 # Current number of unprocessed clauses: 20
% 0.20/0.52 # ...number of literals in the above : 62
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 2
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 1
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 1
% 0.20/0.52 # Non-unit clause-clause subsumptions : 0
% 0.20/0.52 # Unit Clause-clause subsumption calls : 1
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 0
% 0.20/0.52 # BW rewrite match successes : 0
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 1853
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.003 s
% 0.20/0.52 # System time : 0.002 s
% 0.20/0.52 # Total time : 0.005 s
% 0.20/0.52 # Maximum resident set size: 1864 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.006 s
% 0.20/0.52 # System time : 0.003 s
% 0.20/0.52 # Total time : 0.009 s
% 0.20/0.52 # Maximum resident set size: 1724 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------