TSTP Solution File: GEO219+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GEO219+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : Sat May 4 07:45:08 EDT 2024
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 13 unt; 0 def)
% Number of atoms : 112 ( 0 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 118 ( 50 ~; 47 |; 11 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 69 ( 0 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a5,axiom,
! [X1,X2] :
( orthogonal_lines(X1,X2)
<=> ~ unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.9f491pWbGY/E---3.1_11621.p',a5) ).
fof(con,conjecture,
! [X6,X7,X8] :
( ( orthogonal_lines(X6,X7)
& parallel_lines(X6,X8) )
=> orthogonal_lines(X7,X8) ),
file('/export/starexec/sandbox/tmp/tmp.9f491pWbGY/E---3.1_11621.p',con) ).
fof(occu1,axiom,
! [X6,X7] :
( convergent_lines(X6,X7)
| unorthogonal_lines(X6,X7) ),
file('/export/starexec/sandbox/tmp/tmp.9f491pWbGY/E---3.1_11621.p',occu1) ).
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/sandbox/tmp/tmp.9f491pWbGY/E---3.1_11621.p',cotno1) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.9f491pWbGY/E---3.1_11621.p',ceq3) ).
fof(a3,axiom,
! [X1,X2] :
( parallel_lines(X1,X2)
<=> ~ convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.9f491pWbGY/E---3.1_11621.p',a3) ).
fof(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.9f491pWbGY/E---3.1_11621.p',p1) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.9f491pWbGY/E---3.1_11621.p',apart3) ).
fof(c_0_8,plain,
! [X1,X2] :
( orthogonal_lines(X1,X2)
<=> ~ unorthogonal_lines(X1,X2) ),
inference(fof_simplification,[status(thm)],[a5]) ).
fof(c_0_9,negated_conjecture,
~ ! [X6,X7,X8] :
( ( orthogonal_lines(X6,X7)
& parallel_lines(X6,X8) )
=> orthogonal_lines(X7,X8) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_10,plain,
! [X14,X15] :
( ( ~ orthogonal_lines(X14,X15)
| ~ unorthogonal_lines(X14,X15) )
& ( unorthogonal_lines(X14,X15)
| orthogonal_lines(X14,X15) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,negated_conjecture,
( orthogonal_lines(esk1_0,esk2_0)
& parallel_lines(esk1_0,esk3_0)
& ~ orthogonal_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_9])])])]) ).
cnf(c_0_12,plain,
( ~ orthogonal_lines(X1,X2)
| ~ unorthogonal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
orthogonal_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X18,X19] :
( convergent_lines(X18,X19)
| unorthogonal_lines(X18,X19) ),
inference(variable_rename,[status(thm)],[occu1]) ).
fof(c_0_15,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_16,plain,
! [X56,X57,X58] :
( ~ convergent_lines(X56,X57)
| distinct_lines(X57,X58)
| convergent_lines(X56,X58) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])]) ).
cnf(c_0_17,negated_conjecture,
~ unorthogonal_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X1,X2] :
( parallel_lines(X1,X2)
<=> ~ convergent_lines(X1,X2) ),
inference(fof_simplification,[status(thm)],[a3]) ).
fof(c_0_20,plain,
! [X29,X30,X31] :
( ( convergent_lines(X29,X31)
| convergent_lines(X29,X30)
| ~ convergent_lines(X30,X31)
| ~ unorthogonal_lines(X30,X31) )
& ( unorthogonal_lines(X29,X31)
| convergent_lines(X29,X30)
| ~ convergent_lines(X30,X31)
| ~ unorthogonal_lines(X30,X31) )
& ( convergent_lines(X29,X31)
| unorthogonal_lines(X29,X30)
| ~ convergent_lines(X30,X31)
| ~ unorthogonal_lines(X30,X31) )
& ( unorthogonal_lines(X29,X31)
| unorthogonal_lines(X29,X30)
| ~ convergent_lines(X30,X31)
| ~ unorthogonal_lines(X30,X31) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
cnf(c_0_21,negated_conjecture,
~ orthogonal_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
( unorthogonal_lines(X1,X2)
| orthogonal_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_23,plain,
! [X59,X60] :
( ~ distinct_lines(X59,X60)
| convergent_lines(X59,X60) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])]) ).
cnf(c_0_24,plain,
( distinct_lines(X2,X3)
| convergent_lines(X1,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_26,plain,
! [X16,X17] :
( ( ~ parallel_lines(X16,X17)
| ~ convergent_lines(X16,X17) )
& ( convergent_lines(X16,X17)
| parallel_lines(X16,X17) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
fof(c_0_27,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
cnf(c_0_28,plain,
( convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| ~ convergent_lines(X3,X2)
| ~ unorthogonal_lines(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,negated_conjecture,
unorthogonal_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( convergent_lines(esk1_0,X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( ~ parallel_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
parallel_lines(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_34,plain,
! [X35] : ~ convergent_lines(X35,X35),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_27])]) ).
cnf(c_0_35,negated_conjecture,
( convergent_lines(X1,esk3_0)
| convergent_lines(X1,esk2_0)
| ~ convergent_lines(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
~ convergent_lines(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( convergent_lines(X1,esk2_0)
| convergent_lines(X1,esk3_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_40,plain,
( convergent_lines(X1,X2)
| unorthogonal_lines(X1,X3)
| ~ convergent_lines(X3,X2)
| ~ unorthogonal_lines(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_41,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,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_40,c_0_29]),c_0_41])]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_42]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO219+3 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 18:41:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.9f491pWbGY/E---3.1_11621.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_1 with pid 11709 completed with status 0
% 0.20/0.51 # Result found by new_bool_1
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHNF-FFMF00-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 11715 completed with status 0
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FGHNF-FFMF00-SFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.52 # Preprocessing time : 0.001 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 36
% 0.20/0.52 # Removed by relevancy pruning/SinE : 17
% 0.20/0.52 # Initial clauses : 29
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 29
% 0.20/0.52 # Processed clauses : 107
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 25
% 0.20/0.52 # ...remaining for further processing : 82
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 2
% 0.20/0.52 # Backward-rewritten : 1
% 0.20/0.52 # Generated clauses : 192
% 0.20/0.52 # ...of the previous two non-redundant : 159
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 2
% 0.20/0.52 # Paramodulations : 184
% 0.20/0.52 # Factorizations : 8
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 27
% 0.20/0.52 # ...of those cached : 22
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 54
% 0.20/0.52 # Positive orientable unit clauses : 8
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 5
% 0.20/0.52 # Non-unit-clauses : 41
% 0.20/0.52 # Current number of unprocessed clauses: 105
% 0.20/0.52 # ...number of literals in the above : 436
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 28
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 348
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 216
% 0.20/0.52 # Non-unit clause-clause subsumptions : 21
% 0.20/0.52 # Unit Clause-clause subsumption calls : 12
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 1
% 0.20/0.52 # BW rewrite match successes : 1
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 4215
% 0.20/0.52 # Search garbage collected termcells : 410
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.012 s
% 0.20/0.52 # System time : 0.003 s
% 0.20/0.52 # Total time : 0.015 s
% 0.20/0.52 # Maximum resident set size: 1872 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.013 s
% 0.20/0.52 # System time : 0.005 s
% 0.20/0.52 # Total time : 0.019 s
% 0.20/0.52 # Maximum resident set size: 1748 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------