TSTP Solution File: GEO219+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GEO219+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : Mon May 20 20:01:29 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 10 unt; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 100 ( 48 ~; 36 |; 11 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 46 ( 0 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X6,X7,X8] :
( ( ~ unorthogonal_lines(X6,X7)
& ~ convergent_lines(X6,X8) )
=> ~ unorthogonal_lines(X7,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(coipo1,axiom,
! [X6,X7] :
~ ( ~ convergent_lines(X6,X7)
& ~ unorthogonal_lines(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+4.ax',coipo1) ).
fof(cotno1,axiom,
! [X6,X7,X8] :
( ( ( ~ convergent_lines(X6,X7)
| ~ unorthogonal_lines(X6,X7) )
& ( ~ convergent_lines(X6,X8)
| ~ unorthogonal_lines(X6,X8) ) )
=> ( ~ convergent_lines(X7,X8)
| ~ unorthogonal_lines(X7,X8) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+4.ax',cotno1) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ax6) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(c_0_5,negated_conjecture,
~ ! [X6,X7,X8] :
( ( ~ unorthogonal_lines(X6,X7)
& ~ convergent_lines(X6,X8) )
=> ~ unorthogonal_lines(X7,X8) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_6,plain,
! [X6,X7] :
~ ( ~ convergent_lines(X6,X7)
& ~ unorthogonal_lines(X6,X7) ),
inference(fof_simplification,[status(thm)],[coipo1]) ).
fof(c_0_7,plain,
! [X6,X7,X8] :
( ( ( ~ convergent_lines(X6,X7)
| ~ unorthogonal_lines(X6,X7) )
& ( ~ convergent_lines(X6,X8)
| ~ unorthogonal_lines(X6,X8) ) )
=> ( ~ convergent_lines(X7,X8)
| ~ unorthogonal_lines(X7,X8) ) ),
inference(fof_simplification,[status(thm)],[cotno1]) ).
fof(c_0_8,negated_conjecture,
( ~ unorthogonal_lines(esk1_0,esk2_0)
& ~ convergent_lines(esk1_0,esk3_0)
& unorthogonal_lines(esk2_0,esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_9,plain,
! [X12,X13] :
( convergent_lines(X12,X13)
| unorthogonal_lines(X12,X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_10,plain,
! [X14,X15,X16] :
( ( convergent_lines(X14,X16)
| convergent_lines(X14,X15)
| ~ convergent_lines(X15,X16)
| ~ unorthogonal_lines(X15,X16) )
& ( unorthogonal_lines(X14,X16)
| convergent_lines(X14,X15)
| ~ convergent_lines(X15,X16)
| ~ unorthogonal_lines(X15,X16) )
& ( convergent_lines(X14,X16)
| unorthogonal_lines(X14,X15)
| ~ convergent_lines(X15,X16)
| ~ unorthogonal_lines(X15,X16) )
& ( unorthogonal_lines(X14,X16)
| unorthogonal_lines(X14,X15)
| ~ convergent_lines(X15,X16)
| ~ unorthogonal_lines(X15,X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_11,plain,
! [X21,X22,X23] :
( ~ convergent_lines(X21,X22)
| convergent_lines(X21,X23)
| convergent_lines(X22,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])]) ).
cnf(c_0_12,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
cnf(c_0_15,plain,
( convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| ~ convergent_lines(X3,X2)
| ~ unorthogonal_lines(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
unorthogonal_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_19,plain,
! [X20] : ~ convergent_lines(X20,X20),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
cnf(c_0_20,negated_conjecture,
( convergent_lines(X1,esk3_0)
| convergent_lines(X1,esk2_0)
| ~ convergent_lines(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
~ convergent_lines(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( convergent_lines(X1,esk2_0)
| convergent_lines(X1,esk3_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X3)
| ~ convergent_lines(X3,X2)
| ~ unorthogonal_lines(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( unorthogonal_lines(X1,esk2_0)
| convergent_lines(X1,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_26])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_27]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : GEO219+1 : TPTP v8.2.0. Released v3.3.0.
% 0.04/0.09 % Command : run_E %s %d THM
% 0.09/0.28 % Computer : n029.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Sun May 19 14:56:53 EDT 2024
% 0.09/0.28 % CPUTime :
% 0.14/0.37 Running first-order model finding
% 0.14/0.38 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.39 # Version: 3.1.0
% 0.14/0.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.39 # Starting sh5l with 300s (1) cores
% 0.14/0.39 # new_bool_3 with pid 21070 completed with status 0
% 0.14/0.39 # Result found by new_bool_3
% 0.14/0.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.39 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.39 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.14/0.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.39 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.39 # SAT001_MinMin_p005000_rr_RG with pid 21073 completed with status 0
% 0.14/0.39 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.39 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.39 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.39 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.39 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.14/0.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.39 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.39 # Preprocessing time : 0.001 s
% 0.14/0.39 # Presaturation interreduction done
% 0.14/0.39
% 0.14/0.39 # Proof found!
% 0.14/0.39 # SZS status Theorem
% 0.14/0.39 # SZS output start CNFRefutation
% See solution above
% 0.14/0.39 # Parsed axioms : 18
% 0.14/0.39 # Removed by relevancy pruning/SinE : 12
% 0.14/0.39 # Initial clauses : 11
% 0.14/0.39 # Removed in clause preprocessing : 0
% 0.14/0.39 # Initial clauses in saturation : 11
% 0.14/0.39 # Processed clauses : 52
% 0.14/0.39 # ...of these trivial : 0
% 0.14/0.39 # ...subsumed : 11
% 0.14/0.39 # ...remaining for further processing : 41
% 0.14/0.39 # Other redundant clauses eliminated : 0
% 0.14/0.39 # Clauses deleted for lack of memory : 0
% 0.14/0.39 # Backward-subsumed : 2
% 0.14/0.39 # Backward-rewritten : 0
% 0.14/0.39 # Generated clauses : 109
% 0.14/0.39 # ...of the previous two non-redundant : 87
% 0.14/0.39 # ...aggressively subsumed : 0
% 0.14/0.39 # Contextual simplify-reflections : 1
% 0.14/0.39 # Paramodulations : 103
% 0.14/0.39 # Factorizations : 6
% 0.14/0.39 # NegExts : 0
% 0.14/0.39 # Equation resolutions : 0
% 0.14/0.39 # Disequality decompositions : 0
% 0.14/0.39 # Total rewrite steps : 17
% 0.14/0.39 # ...of those cached : 11
% 0.14/0.39 # Propositional unsat checks : 0
% 0.14/0.39 # Propositional check models : 0
% 0.14/0.39 # Propositional check unsatisfiable : 0
% 0.14/0.39 # Propositional clauses : 0
% 0.14/0.39 # Propositional clauses after purity: 0
% 0.14/0.39 # Propositional unsat core size : 0
% 0.14/0.39 # Propositional preprocessing time : 0.000
% 0.14/0.39 # Propositional encoding time : 0.000
% 0.14/0.39 # Propositional solver time : 0.000
% 0.14/0.39 # Success case prop preproc time : 0.000
% 0.14/0.39 # Success case prop encoding time : 0.000
% 0.14/0.39 # Success case prop solver time : 0.000
% 0.14/0.39 # Current number of processed clauses : 29
% 0.14/0.39 # Positive orientable unit clauses : 7
% 0.14/0.39 # Positive unorientable unit clauses: 0
% 0.14/0.39 # Negative unit clauses : 3
% 0.14/0.39 # Non-unit-clauses : 19
% 0.14/0.39 # Current number of unprocessed clauses: 55
% 0.14/0.39 # ...number of literals in the above : 225
% 0.14/0.39 # Current number of archived formulas : 0
% 0.14/0.39 # Current number of archived clauses : 12
% 0.14/0.39 # Clause-clause subsumption calls (NU) : 138
% 0.14/0.39 # Rec. Clause-clause subsumption calls : 108
% 0.14/0.39 # Non-unit clause-clause subsumptions : 9
% 0.14/0.39 # Unit Clause-clause subsumption calls : 12
% 0.14/0.39 # Rewrite failures with RHS unbound : 0
% 0.14/0.39 # BW rewrite match attempts : 1
% 0.14/0.39 # BW rewrite match successes : 1
% 0.14/0.39 # Condensation attempts : 0
% 0.14/0.39 # Condensation successes : 0
% 0.14/0.39 # Termbank termtop insertions : 2009
% 0.14/0.39 # Search garbage collected termcells : 211
% 0.14/0.39
% 0.14/0.39 # -------------------------------------------------
% 0.14/0.39 # User time : 0.007 s
% 0.14/0.39 # System time : 0.000 s
% 0.14/0.39 # Total time : 0.007 s
% 0.14/0.39 # Maximum resident set size: 1748 pages
% 0.14/0.39
% 0.14/0.39 # -------------------------------------------------
% 0.14/0.39 # User time : 0.007 s
% 0.14/0.39 # System time : 0.003 s
% 0.14/0.39 # Total time : 0.010 s
% 0.14/0.39 # Maximum resident set size: 1760 pages
% 0.14/0.39 % E---3.1 exiting
%------------------------------------------------------------------------------