TSTP Solution File: GEO214+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO214+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:34:27 EDT 2023
% Result : Theorem 0.23s 0.54s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 59 ( 21 ~; 27 |; 7 &)
% ( 0 <=>; 4 =>; 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 : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 34 ( 0 sgn; 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X6,X7] :
( unorthogonal_lines(X6,X7)
=> unorthogonal_lines(X7,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.5h9EZgmMcZ/E---3.1_17565.p',con) ).
fof(oac1,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/tmp/tmp.5h9EZgmMcZ/E---3.1_17565.p',oac1) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.5h9EZgmMcZ/E---3.1_17565.p',apart3) ).
fof(occu1,axiom,
! [X6,X7] :
( convergent_lines(X6,X7)
| unorthogonal_lines(X6,X7) ),
file('/export/starexec/sandbox2/tmp/tmp.5h9EZgmMcZ/E---3.1_17565.p',occu1) ).
fof(apart6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.5h9EZgmMcZ/E---3.1_17565.p',apart6) ).
fof(c_0_5,negated_conjecture,
~ ! [X6,X7] :
( unorthogonal_lines(X6,X7)
=> unorthogonal_lines(X7,X6) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_6,plain,
! [X14,X15,X16] :
( ( convergent_lines(X15,X16)
| convergent_lines(X14,X16)
| ~ convergent_lines(X14,X15)
| ~ unorthogonal_lines(X14,X15) )
& ( unorthogonal_lines(X15,X16)
| convergent_lines(X14,X16)
| ~ convergent_lines(X14,X15)
| ~ unorthogonal_lines(X14,X15) )
& ( convergent_lines(X15,X16)
| unorthogonal_lines(X14,X16)
| ~ convergent_lines(X14,X15)
| ~ unorthogonal_lines(X14,X15) )
& ( unorthogonal_lines(X15,X16)
| unorthogonal_lines(X14,X16)
| ~ convergent_lines(X14,X15)
| ~ unorthogonal_lines(X14,X15) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oac1])])]) ).
fof(c_0_7,negated_conjecture,
( unorthogonal_lines(esk1_0,esk2_0)
& ~ unorthogonal_lines(esk2_0,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
fof(c_0_9,plain,
! [X12,X13] :
( convergent_lines(X12,X13)
| unorthogonal_lines(X12,X13) ),
inference(variable_rename,[status(thm)],[occu1]) ).
cnf(c_0_10,plain,
( unorthogonal_lines(X1,X2)
| convergent_lines(X3,X2)
| ~ convergent_lines(X3,X1)
| ~ unorthogonal_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
unorthogonal_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X21] : ~ convergent_lines(X21,X21),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X22,X23,X24] :
( ~ convergent_lines(X22,X23)
| convergent_lines(X22,X24)
| convergent_lines(X23,X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart6])]) ).
cnf(c_0_14,negated_conjecture,
~ unorthogonal_lines(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( unorthogonal_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1)
| ~ convergent_lines(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ convergent_lines(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : GEO214+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n011.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Oct 3 06:17:39 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.23/0.52 Running first-order model finding
% 0.23/0.52 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/tmp/tmp.5h9EZgmMcZ/E---3.1_17565.p
% 0.23/0.54 # Version: 3.1pre001
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # new_bool_1 with pid 17644 completed with status 0
% 0.23/0.54 # Result found by new_bool_1
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.23/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.54 # SAT001_MinMin_p005000_rr_RG with pid 17648 completed with status 0
% 0.23/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.23/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.54 # Preprocessing time : 0.001 s
% 0.23/0.54 # Presaturation interreduction done
% 0.23/0.54
% 0.23/0.54 # Proof found!
% 0.23/0.54 # SZS status Theorem
% 0.23/0.54 # SZS output start CNFRefutation
% See solution above
% 0.23/0.54 # Parsed axioms : 21
% 0.23/0.54 # Removed by relevancy pruning/SinE : 6
% 0.23/0.54 # Initial clauses : 19
% 0.23/0.54 # Removed in clause preprocessing : 0
% 0.23/0.54 # Initial clauses in saturation : 19
% 0.23/0.54 # Processed clauses : 47
% 0.23/0.54 # ...of these trivial : 0
% 0.23/0.54 # ...subsumed : 3
% 0.23/0.54 # ...remaining for further processing : 44
% 0.23/0.54 # Other redundant clauses eliminated : 0
% 0.23/0.54 # Clauses deleted for lack of memory : 0
% 0.23/0.54 # Backward-subsumed : 2
% 0.23/0.54 # Backward-rewritten : 0
% 0.23/0.54 # Generated clauses : 35
% 0.23/0.54 # ...of the previous two non-redundant : 26
% 0.23/0.54 # ...aggressively subsumed : 0
% 0.23/0.54 # Contextual simplify-reflections : 0
% 0.23/0.54 # Paramodulations : 33
% 0.23/0.54 # Factorizations : 2
% 0.23/0.54 # NegExts : 0
% 0.23/0.54 # Equation resolutions : 0
% 0.23/0.54 # Total rewrite steps : 5
% 0.23/0.54 # Propositional unsat checks : 0
% 0.23/0.54 # Propositional check models : 0
% 0.23/0.54 # Propositional check unsatisfiable : 0
% 0.23/0.54 # Propositional clauses : 0
% 0.23/0.54 # Propositional clauses after purity: 0
% 0.23/0.54 # Propositional unsat core size : 0
% 0.23/0.54 # Propositional preprocessing time : 0.000
% 0.23/0.54 # Propositional encoding time : 0.000
% 0.23/0.54 # Propositional solver time : 0.000
% 0.23/0.54 # Success case prop preproc time : 0.000
% 0.23/0.54 # Success case prop encoding time : 0.000
% 0.23/0.54 # Success case prop solver time : 0.000
% 0.23/0.54 # Current number of processed clauses : 24
% 0.23/0.54 # Positive orientable unit clauses : 3
% 0.23/0.54 # Positive unorientable unit clauses: 0
% 0.23/0.54 # Negative unit clauses : 5
% 0.23/0.54 # Non-unit-clauses : 16
% 0.23/0.54 # Current number of unprocessed clauses: 16
% 0.23/0.54 # ...number of literals in the above : 68
% 0.23/0.54 # Current number of archived formulas : 0
% 0.23/0.54 # Current number of archived clauses : 20
% 0.23/0.54 # Clause-clause subsumption calls (NU) : 36
% 0.23/0.54 # Rec. Clause-clause subsumption calls : 33
% 0.23/0.54 # Non-unit clause-clause subsumptions : 2
% 0.23/0.54 # Unit Clause-clause subsumption calls : 3
% 0.23/0.54 # Rewrite failures with RHS unbound : 0
% 0.23/0.54 # BW rewrite match attempts : 0
% 0.23/0.54 # BW rewrite match successes : 0
% 0.23/0.54 # Condensation attempts : 0
% 0.23/0.54 # Condensation successes : 0
% 0.23/0.54 # Termbank termtop insertions : 1642
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.007 s
% 0.23/0.54 # System time : 0.000 s
% 0.23/0.54 # Total time : 0.007 s
% 0.23/0.54 # Maximum resident set size: 1752 pages
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.009 s
% 0.23/0.54 # System time : 0.002 s
% 0.23/0.54 # Total time : 0.011 s
% 0.23/0.54 # Maximum resident set size: 1692 pages
% 0.23/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------