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