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