TSTP Solution File: GEO226+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO226+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : Timeout 408.23s 300.12s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 2 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 56 ( 23 ~; 12 |; 11 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn; 23 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X6,X7] :
( ( line(X6)
& line(X7)
& convergent_lines(X6,X7) )
=> ? [X1] :
( point(X1)
=> ( incident_point_and_line(X1,X6)
& incident_point_and_line(X1,X7) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ebwYa8feV9/E---3.1_30504.p',con) ).
fof(a4,axiom,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.ebwYa8feV9/E---3.1_30504.p',a4) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.ebwYa8feV9/E---3.1_30504.p',ci4) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/tmp.ebwYa8feV9/E---3.1_30504.p',ci3) ).
fof(c_0_4,negated_conjecture,
~ ! [X6,X7] :
( ( line(X6)
& line(X7)
& convergent_lines(X6,X7) )
=> ? [X1] :
( point(X1)
=> ( incident_point_and_line(X1,X6)
& incident_point_and_line(X1,X7) ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_5,plain,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
inference(fof_simplification,[status(thm)],[a4]) ).
fof(c_0_6,negated_conjecture,
! [X13] :
( line(esk1_0)
& line(esk2_0)
& convergent_lines(esk1_0,esk2_0)
& point(X13)
& ( ~ incident_point_and_line(X13,esk1_0)
| ~ incident_point_and_line(X13,esk2_0) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
fof(c_0_8,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_9,negated_conjecture,
( ~ incident_point_and_line(X1,esk1_0)
| ~ incident_point_and_line(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( apart_point_and_line(X1,X2)
| incident_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[ci3]) ).
fof(c_0_12,plain,
! [X55,X56] :
( ~ convergent_lines(X55,X56)
| ~ apart_point_and_line(intersection_point(X55,X56),X56) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
cnf(c_0_13,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| ~ incident_point_and_line(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_14,plain,
! [X53,X54] :
( ~ convergent_lines(X53,X54)
| ~ apart_point_and_line(intersection_point(X53,X54),X53) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
cnf(c_0_15,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_17,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( apart_point_and_line(intersection_point(X1,esk2_0),esk1_0)
| ~ convergent_lines(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : GEO226+3 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n013.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 06:28:14 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.ebwYa8feV9/E---3.1_30504.p
% 408.23/300.12 # Version: 3.1pre001
% 408.23/300.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.23/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.23/300.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.23/300.12 # Starting new_bool_3 with 300s (1) cores
% 408.23/300.12 # Starting new_bool_1 with 300s (1) cores
% 408.23/300.12 # Starting sh5l with 300s (1) cores
% 408.23/300.12 # sh5l with pid 30586 completed with status 0
% 408.23/300.12 # Result found by sh5l
% 408.23/300.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.23/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.23/300.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.23/300.12 # Starting new_bool_3 with 300s (1) cores
% 408.23/300.12 # Starting new_bool_1 with 300s (1) cores
% 408.23/300.12 # Starting sh5l with 300s (1) cores
% 408.23/300.12 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.23/300.12 # Search class: FGHNF-FFMS22-SFFFFFNN
% 408.23/300.12 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.23/300.12 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.23/300.12 # SAT001_MinMin_p005000_rr_RG with pid 30591 completed with status 0
% 408.23/300.12 # Result found by SAT001_MinMin_p005000_rr_RG
% 408.23/300.12 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.23/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.23/300.12 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.23/300.12 # Starting new_bool_3 with 300s (1) cores
% 408.23/300.12 # Starting new_bool_1 with 300s (1) cores
% 408.23/300.12 # Starting sh5l with 300s (1) cores
% 408.23/300.12 # SinE strategy is gf500_gu_R04_F100_L20000
% 408.23/300.12 # Search class: FGHNF-FFMS22-SFFFFFNN
% 408.23/300.12 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.23/300.12 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.23/300.12 # Preprocessing time : 0.001 s
% 408.23/300.12 # Presaturation interreduction done
% 408.23/300.12
% 408.23/300.12 # Proof found!
% 408.23/300.12 # SZS status Theorem
% 408.23/300.12 # SZS output start CNFRefutation
% See solution above
% 408.23/300.12 # Parsed axioms : 36
% 408.23/300.12 # Removed by relevancy pruning/SinE : 4
% 408.23/300.12 # Initial clauses : 43
% 408.23/300.12 # Removed in clause preprocessing : 0
% 408.23/300.12 # Initial clauses in saturation : 43
% 408.23/300.12 # Processed clauses : 68
% 408.23/300.12 # ...of these trivial : 1
% 408.23/300.12 # ...subsumed : 4
% 408.23/300.12 # ...remaining for further processing : 63
% 408.23/300.12 # Other redundant clauses eliminated : 0
% 408.23/300.12 # Clauses deleted for lack of memory : 0
% 408.23/300.12 # Backward-subsumed : 0
% 408.23/300.12 # Backward-rewritten : 0
% 408.23/300.12 # Generated clauses : 7
% 408.23/300.12 # ...of the previous two non-redundant : 5
% 408.23/300.12 # ...aggressively subsumed : 0
% 408.23/300.12 # Contextual simplify-reflections : 0
% 408.23/300.12 # Paramodulations : 7
% 408.23/300.12 # Factorizations : 0
% 408.23/300.12 # NegExts : 0
% 408.23/300.12 # Equation resolutions : 0
% 408.23/300.12 # Total rewrite steps : 6
% 408.23/300.12 # Propositional unsat checks : 0
% 408.23/300.12 # Propositional check models : 0
% 408.23/300.12 # Propositional check unsatisfiable : 0
% 408.23/300.12 # Propositional clauses : 0
% 408.23/300.12 # Propositional clauses after purity: 0
% 408.23/300.12 # Propositional unsat core size : 0
% 408.23/300.12 # Propositional preprocessing time : 0.000
% 408.23/300.12 # Propositional encoding time : 0.000
% 408.23/300.12 # Propositional solver time : 0.000
% 408.23/300.12 # Success case prop preproc time : 0.000
% 408.23/300.12 # Success case prop encoding time : 0.000
% 408.23/300.12 # Success case prop solver time : 0.000
% 408.23/300.12 # Current number of processed clauses : 25
% 408.23/300.12 # Positive orientable unit clauses : 4
% 408.23/300.12 # Positive unorientable unit clauses: 0
% 408.23/300.12 # Negative unit clauses : 7
% 408.23/300.12 # Non-unit-clauses : 14
% 408.23/300.12 # Current number of unprocessed clauses: 18
% 408.23/300.12 # ...number of literals in the above : 61
% 408.23/300.12 # Current number of archived formulas : 0
% 408.23/300.12 # Current number of archived clauses : 38
% 408.23/300.12 # Clause-clause subsumption calls (NU) : 98
% 408.23/300.12 # Rec. Clause-clause subsumption calls : 68
% 408.23/300.12 # Non-unit clause-clause subsumptions : 4
% 408.23/300.12 # Unit Clause-clause subsumption calls : 9
% 408.23/300.12 # Rewrite failures with RHS unbound : 0
% 408.23/300.12 # BW rewrite match attempts : 0
% 408.23/300.12 # BW rewrite match successes : 0
% 408.23/300.12 # Condensation attempts : 0
% 408.23/300.12 # Condensation successes : 0
% 408.23/300.12 # Termbank termtop insertions : 2754
% 408.23/300.12
% 408.23/300.12 # -------------------------------------------------
% 408.23/300.12 # User time : 0.006 s
% 408.23/300.12 # System time : 0.002 s
% 408.23/300.12 # Total time : 0.008 s
% 408.23/300.12 # Maximum resident set size: 1888 pages
% 408.23/300.12
% 408.23/300.12 # -------------------------------------------------
% 408.23/300.12 # User time : 0.007 s
% 408.23/300.12 # System time : 0.004 s
% 408.23/300.12 # Total time : 0.011 s
% 408.23/300.12 # Maximum resident set size: 1712 pages
% 408.23/300.12 % E---3.1 exiting
% 408.23/300.12 % E---3.1 exiting
%------------------------------------------------------------------------------