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