TSTP Solution File: ALG199+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ALG199+1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:15:42 EDT 2024
% Result : Theorem 0.21s 0.56s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 13 unt; 0 def)
% Number of atoms : 152 ( 151 equ)
% Maximal formula atoms : 21 ( 7 avg)
% Number of connectives : 246 ( 115 ~; 42 |; 89 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
~ ( op(e0,e0) != e0
& op(e1,e1) != e1
& op(e2,e2) != e2
& op(e3,e3) != e3
& op(e4,e4) != e4
& op(e5,e5) != e5
& op(e6,e6) != e6
& ( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 )
& ( op(e0,e0) != e0
| op(e1,e1) != e1
| op(e2,e2) != e2
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ) ),
file('/export/starexec/sandbox2/tmp/tmp.sjqJA0vtB0/E---3.1_7074.p',co1) ).
fof(ax6,axiom,
( e0 = op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),op(e5,op(e5,e5)))
& e1 = op(e5,e5)
& e2 = op(op(e5,op(e5,e5)),op(e5,op(e5,e5)))
& e3 = op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),e5)
& e4 = op(e5,op(e5,e5))
& e6 = op(op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),e5),op(e5,op(e5,e5))) ),
file('/export/starexec/sandbox2/tmp/tmp.sjqJA0vtB0/E---3.1_7074.p',ax6) ).
fof(ax5,axiom,
( e0 != e1
& e0 != e2
& e0 != e3
& e0 != e4
& e0 != e5
& e0 != e6
& e1 != e2
& e1 != e3
& e1 != e4
& e1 != e5
& e1 != e6
& e2 != e3
& e2 != e4
& e2 != e5
& e2 != e6
& e3 != e4
& e3 != e5
& e3 != e6
& e4 != e5
& e4 != e6
& e5 != e6 ),
file('/export/starexec/sandbox2/tmp/tmp.sjqJA0vtB0/E---3.1_7074.p',ax5) ).
fof(c_0_3,negated_conjecture,
~ ~ ( op(e0,e0) != e0
& op(e1,e1) != e1
& op(e2,e2) != e2
& op(e3,e3) != e3
& op(e4,e4) != e4
& op(e5,e5) != e5
& op(e6,e6) != e6
& ( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 )
& ( op(e0,e0) != e0
| op(e1,e1) != e1
| op(e2,e2) != e2
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
cnf(c_0_4,plain,
e4 = op(e5,op(e5,e5)),
inference(split_conjunct,[status(thm)],[ax6]) ).
cnf(c_0_5,plain,
e1 = op(e5,e5),
inference(split_conjunct,[status(thm)],[ax6]) ).
fof(c_0_6,plain,
( e0 != e1
& e0 != e2
& e0 != e3
& e0 != e4
& e0 != e5
& e0 != e6
& e1 != e2
& e1 != e3
& e1 != e4
& e1 != e5
& e1 != e6
& e2 != e3
& e2 != e4
& e2 != e5
& e2 != e6
& e3 != e4
& e3 != e5
& e3 != e6
& e4 != e5
& e4 != e6
& e5 != e6 ),
inference(fof_simplification,[status(thm)],[ax5]) ).
fof(c_0_7,negated_conjecture,
( op(e0,e0) != e0
& op(e1,e1) != e1
& op(e2,e2) != e2
& op(e3,e3) != e3
& op(e4,e4) != e4
& op(e5,e5) != e5
& op(e6,e6) != e6
& ( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 )
& ( op(e0,e0) != e0
| op(e1,e1) != e1
| op(e2,e2) != e2
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
cnf(c_0_8,plain,
e2 = op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),
inference(split_conjunct,[status(thm)],[ax6]) ).
cnf(c_0_9,plain,
op(e5,e1) = e4,
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
fof(c_0_10,plain,
( e0 != e1
& e0 != e2
& e0 != e3
& e0 != e4
& e0 != e5
& e0 != e6
& e1 != e2
& e1 != e3
& e1 != e4
& e1 != e5
& e1 != e6
& e2 != e3
& e2 != e4
& e2 != e5
& e2 != e6
& e3 != e4
& e3 != e5
& e3 != e6
& e4 != e5
& e4 != e6
& e5 != e6 ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
op(e4,e4) = e2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_5]),c_0_9]),c_0_5]),c_0_9]) ).
cnf(c_0_13,negated_conjecture,
op(e0,e0) != e0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
op(e1,e1) != e1,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
op(e2,e2) != e2,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
op(e3,e3) != e3,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
e2 != e4,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
e1 != e5,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
op(e6,e6) != e6,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_5]),c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.16 % Problem : ALG199+1 : TPTP v8.1.2. Released v2.7.0.
% 0.11/0.17 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n022.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 13:47:57 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.21/0.53 Running first-order theorem proving
% 0.21/0.53 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.sjqJA0vtB0/E---3.1_7074.p
% 0.21/0.56 # Version: 3.1.0
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # Starting sh5l with 300s (1) cores
% 0.21/0.56 # new_bool_1 with pid 7154 completed with status 0
% 0.21/0.56 # Result found by new_bool_1
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.56 # Search class: FGHPF-FSLM22-MFFFFFNN
% 0.21/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.56 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.56 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 7161 completed with status 0
% 0.21/0.56 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.56 # Search class: FGHPF-FSLM22-MFFFFFNN
% 0.21/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.56 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.56 # Preprocessing time : 0.004 s
% 0.21/0.56 # Presaturation interreduction done
% 0.21/0.56
% 0.21/0.56 # Proof found!
% 0.21/0.56 # SZS status Theorem
% 0.21/0.56 # SZS output start CNFRefutation
% See solution above
% 0.21/0.56 # Parsed axioms : 7
% 0.21/0.56 # Removed by relevancy pruning/SinE : 0
% 0.21/0.56 # Initial clauses : 526
% 0.21/0.56 # Removed in clause preprocessing : 0
% 0.21/0.56 # Initial clauses in saturation : 526
% 0.21/0.56 # Processed clauses : 418
% 0.21/0.56 # ...of these trivial : 0
% 0.21/0.56 # ...subsumed : 7
% 0.21/0.56 # ...remaining for further processing : 410
% 0.21/0.56 # Other redundant clauses eliminated : 0
% 0.21/0.56 # Clauses deleted for lack of memory : 0
% 0.21/0.56 # Backward-subsumed : 0
% 0.21/0.56 # Backward-rewritten : 36
% 0.21/0.56 # Generated clauses : 1
% 0.21/0.56 # ...of the previous two non-redundant : 37
% 0.21/0.56 # ...aggressively subsumed : 0
% 0.21/0.56 # Contextual simplify-reflections : 0
% 0.21/0.56 # Paramodulations : 0
% 0.21/0.56 # Factorizations : 0
% 0.21/0.56 # NegExts : 0
% 0.21/0.56 # Equation resolutions : 0
% 0.21/0.56 # Disequality decompositions : 0
% 0.21/0.56 # Total rewrite steps : 84
% 0.21/0.56 # ...of those cached : 79
% 0.21/0.56 # Propositional unsat checks : 0
% 0.21/0.56 # Propositional check models : 0
% 0.21/0.56 # Propositional check unsatisfiable : 0
% 0.21/0.56 # Propositional clauses : 0
% 0.21/0.56 # Propositional clauses after purity: 0
% 0.21/0.56 # Propositional unsat core size : 0
% 0.21/0.56 # Propositional preprocessing time : 0.000
% 0.21/0.56 # Propositional encoding time : 0.000
% 0.21/0.56 # Propositional solver time : 0.000
% 0.21/0.56 # Success case prop preproc time : 0.000
% 0.21/0.56 # Success case prop encoding time : 0.000
% 0.21/0.56 # Success case prop solver time : 0.000
% 0.21/0.56 # Current number of processed clauses : 373
% 0.21/0.56 # Positive orientable unit clauses : 54
% 0.21/0.56 # Positive unorientable unit clauses: 0
% 0.21/0.56 # Negative unit clauses : 316
% 0.21/0.56 # Non-unit-clauses : 3
% 0.21/0.56 # Current number of unprocessed clauses: 145
% 0.21/0.56 # ...number of literals in the above : 1009
% 0.21/0.56 # Current number of archived formulas : 0
% 0.21/0.56 # Current number of archived clauses : 37
% 0.21/0.56 # Clause-clause subsumption calls (NU) : 4
% 0.21/0.56 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.56 # Non-unit clause-clause subsumptions : 0
% 0.21/0.56 # Unit Clause-clause subsumption calls : 3372
% 0.21/0.56 # Rewrite failures with RHS unbound : 0
% 0.21/0.56 # BW rewrite match attempts : 139
% 0.21/0.56 # BW rewrite match successes : 3
% 0.21/0.56 # Condensation attempts : 0
% 0.21/0.56 # Condensation successes : 0
% 0.21/0.56 # Termbank termtop insertions : 36276
% 0.21/0.56 # Search garbage collected termcells : 966
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.016 s
% 0.21/0.56 # System time : 0.006 s
% 0.21/0.56 # Total time : 0.022 s
% 0.21/0.56 # Maximum resident set size: 2496 pages
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.021 s
% 0.21/0.56 # System time : 0.007 s
% 0.21/0.56 # Total time : 0.029 s
% 0.21/0.56 # Maximum resident set size: 1968 pages
% 0.21/0.56 % E---3.1 exiting
% 0.47/0.56 % E exiting
%------------------------------------------------------------------------------