TSTP Solution File: ALG175+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG175+1 : TPTP v8.2.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : Mon May 20 18:12:16 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 8 unt; 0 def)
% Number of atoms : 191 ( 190 equ)
% Maximal formula atoms : 50 ( 12 avg)
% Number of connectives : 210 ( 34 ~; 0 |; 176 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 52 ( 13 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
~ ( op(e0,op(e0,e0)) = e0
& op(e0,op(e0,e1)) = e1
& op(e0,op(e0,e2)) = e2
& op(e0,op(e0,e3)) = e3
& op(e0,op(e0,e4)) = e4
& op(e1,op(e1,e0)) = e0
& op(e1,op(e1,e1)) = e1
& op(e1,op(e1,e2)) = e2
& op(e1,op(e1,e3)) = e3
& op(e1,op(e1,e4)) = e4
& op(e2,op(e2,e0)) = e0
& op(e2,op(e2,e1)) = e1
& op(e2,op(e2,e2)) = e2
& op(e2,op(e2,e3)) = e3
& op(e2,op(e2,e4)) = e4
& op(e3,op(e3,e0)) = e0
& op(e3,op(e3,e1)) = e1
& op(e3,op(e3,e2)) = e2
& op(e3,op(e3,e3)) = e3
& op(e3,op(e3,e4)) = e4
& op(e4,op(e4,e0)) = e0
& op(e4,op(e4,e1)) = e1
& op(e4,op(e4,e2)) = e2
& op(e4,op(e4,e3)) = e3
& op(e4,op(e4,e4)) = e4
& op(op(e0,e0),e0) = e0
& op(op(e0,e1),e1) = e0
& op(op(e0,e2),e2) = e0
& op(op(e0,e3),e3) = e0
& op(op(e0,e4),e4) = e0
& op(op(e1,e0),e0) = e1
& op(op(e1,e1),e1) = e1
& op(op(e1,e2),e2) = e1
& op(op(e1,e3),e3) = e1
& op(op(e1,e4),e4) = e1
& op(op(e2,e0),e0) = e2
& op(op(e2,e1),e1) = e2
& op(op(e2,e2),e2) = e2
& op(op(e2,e3),e3) = e2
& op(op(e2,e4),e4) = e2
& op(op(e3,e0),e0) = e3
& op(op(e3,e1),e1) = e3
& op(op(e3,e2),e2) = e3
& op(op(e3,e3),e3) = e3
& op(op(e3,e4),e4) = e3
& op(op(e4,e0),e0) = e4
& op(op(e4,e1),e1) = e4
& op(op(e4,e2),e2) = e4
& op(op(e4,e3),e3) = e4
& op(op(e4,e4),e4) = e4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax5,axiom,
( e0 != e1
& e0 != e2
& e0 != e3
& e0 != e4
& e1 != e2
& e1 != e3
& e1 != e4
& e2 != e3
& e2 != e4
& e3 != e4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
fof(ax6,axiom,
( e0 = op(op(e3,e1),e3)
& e2 = op(e3,op(op(e3,e1),e3))
& e4 = op(e3,e1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
fof(c_0_3,negated_conjecture,
~ ~ ( op(e0,op(e0,e0)) = e0
& op(e0,op(e0,e1)) = e1
& op(e0,op(e0,e2)) = e2
& op(e0,op(e0,e3)) = e3
& op(e0,op(e0,e4)) = e4
& op(e1,op(e1,e0)) = e0
& op(e1,op(e1,e1)) = e1
& op(e1,op(e1,e2)) = e2
& op(e1,op(e1,e3)) = e3
& op(e1,op(e1,e4)) = e4
& op(e2,op(e2,e0)) = e0
& op(e2,op(e2,e1)) = e1
& op(e2,op(e2,e2)) = e2
& op(e2,op(e2,e3)) = e3
& op(e2,op(e2,e4)) = e4
& op(e3,op(e3,e0)) = e0
& op(e3,op(e3,e1)) = e1
& op(e3,op(e3,e2)) = e2
& op(e3,op(e3,e3)) = e3
& op(e3,op(e3,e4)) = e4
& op(e4,op(e4,e0)) = e0
& op(e4,op(e4,e1)) = e1
& op(e4,op(e4,e2)) = e2
& op(e4,op(e4,e3)) = e3
& op(e4,op(e4,e4)) = e4
& op(op(e0,e0),e0) = e0
& op(op(e0,e1),e1) = e0
& op(op(e0,e2),e2) = e0
& op(op(e0,e3),e3) = e0
& op(op(e0,e4),e4) = e0
& op(op(e1,e0),e0) = e1
& op(op(e1,e1),e1) = e1
& op(op(e1,e2),e2) = e1
& op(op(e1,e3),e3) = e1
& op(op(e1,e4),e4) = e1
& op(op(e2,e0),e0) = e2
& op(op(e2,e1),e1) = e2
& op(op(e2,e2),e2) = e2
& op(op(e2,e3),e3) = e2
& op(op(e2,e4),e4) = e2
& op(op(e3,e0),e0) = e3
& op(op(e3,e1),e1) = e3
& op(op(e3,e2),e2) = e3
& op(op(e3,e3),e3) = e3
& op(op(e3,e4),e4) = e3
& op(op(e4,e0),e0) = e4
& op(op(e4,e1),e1) = e4
& op(op(e4,e2),e2) = e4
& op(op(e4,e3),e3) = e4
& op(op(e4,e4),e4) = e4 ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_4,negated_conjecture,
( op(e0,op(e0,e0)) = e0
& op(e0,op(e0,e1)) = e1
& op(e0,op(e0,e2)) = e2
& op(e0,op(e0,e3)) = e3
& op(e0,op(e0,e4)) = e4
& op(e1,op(e1,e0)) = e0
& op(e1,op(e1,e1)) = e1
& op(e1,op(e1,e2)) = e2
& op(e1,op(e1,e3)) = e3
& op(e1,op(e1,e4)) = e4
& op(e2,op(e2,e0)) = e0
& op(e2,op(e2,e1)) = e1
& op(e2,op(e2,e2)) = e2
& op(e2,op(e2,e3)) = e3
& op(e2,op(e2,e4)) = e4
& op(e3,op(e3,e0)) = e0
& op(e3,op(e3,e1)) = e1
& op(e3,op(e3,e2)) = e2
& op(e3,op(e3,e3)) = e3
& op(e3,op(e3,e4)) = e4
& op(e4,op(e4,e0)) = e0
& op(e4,op(e4,e1)) = e1
& op(e4,op(e4,e2)) = e2
& op(e4,op(e4,e3)) = e3
& op(e4,op(e4,e4)) = e4
& op(op(e0,e0),e0) = e0
& op(op(e0,e1),e1) = e0
& op(op(e0,e2),e2) = e0
& op(op(e0,e3),e3) = e0
& op(op(e0,e4),e4) = e0
& op(op(e1,e0),e0) = e1
& op(op(e1,e1),e1) = e1
& op(op(e1,e2),e2) = e1
& op(op(e1,e3),e3) = e1
& op(op(e1,e4),e4) = e1
& op(op(e2,e0),e0) = e2
& op(op(e2,e1),e1) = e2
& op(op(e2,e2),e2) = e2
& op(op(e2,e3),e3) = e2
& op(op(e2,e4),e4) = e2
& op(op(e3,e0),e0) = e3
& op(op(e3,e1),e1) = e3
& op(op(e3,e2),e2) = e3
& op(op(e3,e3),e3) = e3
& op(op(e3,e4),e4) = e3
& op(op(e4,e0),e0) = e4
& op(op(e4,e1),e1) = e4
& op(op(e4,e2),e2) = e4
& op(op(e4,e3),e3) = e4
& op(op(e4,e4),e4) = e4 ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
fof(c_0_5,plain,
( e0 != e1
& e0 != e2
& e0 != e3
& e0 != e4
& e1 != e2
& e1 != e3
& e1 != e4
& e2 != e3
& e2 != e4
& e3 != e4 ),
inference(fof_simplification,[status(thm)],[ax5]) ).
cnf(c_0_6,negated_conjecture,
op(op(e3,e1),e1) = e3,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
e4 = op(e3,e1),
inference(split_conjunct,[status(thm)],[ax6]) ).
cnf(c_0_8,plain,
e0 = op(op(e3,e1),e3),
inference(split_conjunct,[status(thm)],[ax6]) ).
fof(c_0_9,plain,
( e0 != e1
& e0 != e2
& e0 != e3
& e0 != e4
& e1 != e2
& e1 != e3
& e1 != e4
& e2 != e3
& e2 != e4
& e3 != e4 ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
op(e4,op(e4,e1)) = e1,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
op(e4,e1) = e3,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,plain,
op(e4,e3) = e0,
inference(rw,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_13,plain,
e0 != e1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : ALG175+1 : TPTP v8.2.0. Released v2.7.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n019.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Sat May 18 23:26:23 EDT 2024
% 0.15/0.34 % 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/benchmark/theBenchmark.p
% 0.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 31337 completed with status 0
% 0.20/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGUPF-FSLM22-MFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.51 # Starting sh5l with 136s (1) cores
% 0.20/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 31342 completed with status 0
% 0.20/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.51 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGUPF-FSLM22-MFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.51 # Preprocessing time : 0.003 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 7
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 263
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 263
% 0.20/0.51 # Processed clauses : 154
% 0.20/0.51 # ...of these trivial : 1
% 0.20/0.51 # ...subsumed : 0
% 0.20/0.51 # ...remaining for further processing : 153
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 24
% 0.20/0.51 # Generated clauses : 0
% 0.20/0.51 # ...of the previous two non-redundant : 22
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 0
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 49
% 0.20/0.51 # ...of those cached : 44
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 129
% 0.20/0.51 # Positive orientable unit clauses : 41
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 88
% 0.20/0.51 # Non-unit-clauses : 0
% 0.20/0.51 # Current number of unprocessed clauses: 124
% 0.20/0.51 # ...number of literals in the above : 424
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 24
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 108
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 3
% 0.20/0.51 # BW rewrite match successes : 3
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 14451
% 0.20/0.51 # Search garbage collected termcells : 328
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.008 s
% 0.20/0.51 # System time : 0.006 s
% 0.20/0.51 # Total time : 0.014 s
% 0.20/0.51 # Maximum resident set size: 2032 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.031 s
% 0.20/0.51 # System time : 0.016 s
% 0.20/0.51 # Total time : 0.047 s
% 0.20/0.51 # Maximum resident set size: 1800 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------