TSTP Solution File: ALG174+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG174+1 : TPTP v8.2.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 8 unt; 0 def)
% Number of atoms : 204 ( 196 equ)
% Maximal formula atoms : 50 ( 12 avg)
% Number of connectives : 276 ( 89 ~; 13 |; 173 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 10 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 2 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,e0) != e0
& op(e0,e1) != e1
& op(e0,e2) != e2
& op(e0,e3) != e3
& op(e0,e4) != e4 )
| ( op(e1,e0) != e0
& op(e1,e1) != e1
& op(e1,e2) != e2
& op(e1,e3) != e3
& op(e1,e4) != e4 )
| ( op(e2,e0) != e0
& op(e2,e1) != e1
& op(e2,e2) != e2
& op(e2,e3) != e3
& op(e2,e4) != e4 )
| ( op(e3,e0) != e0
& op(e3,e1) != e1
& op(e3,e2) != e2
& op(e3,e3) != e3
& op(e3,e4) != e4 )
| ( op(e4,e0) != e0
& op(e4,e1) != e1
& op(e4,e2) != e2
& op(e4,e3) != e3
& 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(ax3,axiom,
( op(op(e0,e0),op(e0,e0)) = e0
& op(op(e1,e0),op(e0,e1)) = e0
& op(op(e2,e0),op(e0,e2)) = e0
& op(op(e3,e0),op(e0,e3)) = e0
& op(op(e4,e0),op(e0,e4)) = e0
& op(op(e0,e1),op(e1,e0)) = e1
& op(op(e1,e1),op(e1,e1)) = e1
& op(op(e2,e1),op(e1,e2)) = e1
& op(op(e3,e1),op(e1,e3)) = e1
& op(op(e4,e1),op(e1,e4)) = e1
& op(op(e0,e2),op(e2,e0)) = e2
& op(op(e1,e2),op(e2,e1)) = e2
& op(op(e2,e2),op(e2,e2)) = e2
& op(op(e3,e2),op(e2,e3)) = e2
& op(op(e4,e2),op(e2,e4)) = e2
& op(op(e0,e3),op(e3,e0)) = e3
& op(op(e1,e3),op(e3,e1)) = e3
& op(op(e2,e3),op(e3,e2)) = e3
& op(op(e3,e3),op(e3,e3)) = e3
& op(op(e4,e3),op(e3,e4)) = e3
& op(op(e0,e4),op(e4,e0)) = e4
& op(op(e1,e4),op(e4,e1)) = e4
& op(op(e2,e4),op(e4,e2)) = e4
& op(op(e3,e4),op(e4,e3)) = e4
& op(op(e4,e4),op(e4,e4)) = e4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(ax6,axiom,
( e0 = op(op(e3,op(e3,e3)),op(e3,op(e3,e3)))
& e1 = op(e3,op(e3,op(e3,e3)))
& e2 = op(e3,e3)
& e4 = op(e3,op(e3,e3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
fof(c_0_4,plain,
( epred2_0
<=> ( ( op(e0,e0) != e0
& op(e0,e1) != e1
& op(e0,e2) != e2
& op(e0,e3) != e3
& op(e0,e4) != e4 )
| ( op(e1,e0) != e0
& op(e1,e1) != e1
& op(e1,e2) != e2
& op(e1,e3) != e3
& op(e1,e4) != e4 )
| ( op(e2,e0) != e0
& op(e2,e1) != e1
& op(e2,e2) != e2
& op(e2,e3) != e3
& op(e2,e4) != e4 )
| ( op(e3,e0) != e0
& op(e3,e1) != e1
& op(e3,e2) != e2
& op(e3,e3) != e3
& op(e3,e4) != e4 ) ) ),
introduced(definition) ).
fof(c_0_5,negated_conjecture,
~ ~ ( ( epred2_0
| ( op(e4,e0) != e0
& op(e4,e1) != e1
& op(e4,e2) != e2
& op(e4,e3) != e3
& 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(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]),c_0_4]) ).
fof(c_0_6,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]) ).
fof(c_0_7,negated_conjecture,
( ( op(e4,e0) != e0
| epred2_0 )
& ( op(e4,e1) != e1
| epred2_0 )
& ( op(e4,e2) != e2
| epred2_0 )
& ( op(e4,e3) != e3
| epred2_0 )
& ( op(e4,e4) != e4
| epred2_0 )
& 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(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_8,plain,
op(op(e3,e3),op(e3,e3)) = e3,
inference(split_conjunct,[status(thm)],[ax3]) ).
cnf(c_0_9,plain,
e2 = op(e3,e3),
inference(split_conjunct,[status(thm)],[ax6]) ).
cnf(c_0_10,plain,
e4 = op(e3,op(e3,e3)),
inference(split_conjunct,[status(thm)],[ax6]) ).
fof(c_0_11,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_6]) ).
cnf(c_0_12,negated_conjecture,
op(op(e2,e2),e2) = e2,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
op(e2,e2) = e3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
cnf(c_0_14,plain,
op(e3,e2) = e4,
inference(rw,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_15,plain,
e2 != e4,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : ALG174+1 : TPTP v8.2.0. Released v2.7.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n012.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Sat May 18 22:45:53 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 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.16/0.45 # Version: 3.1.0
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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 23158 completed with status 0
% 0.16/0.45 # Result found by new_bool_3
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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: FGHSF-FSLM22-MFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.45 # U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 23164 completed with status 0
% 0.16/0.45 # Result found by U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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: FGHSF-FSLM22-MFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.45 # Preprocessing time : 0.002 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 : 7
% 0.16/0.45 # Removed by relevancy pruning/SinE : 0
% 0.16/0.45 # Initial clauses : 294
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 294
% 0.16/0.45 # Processed clauses : 24
% 0.16/0.45 # ...of these trivial : 0
% 0.16/0.45 # ...subsumed : 0
% 0.16/0.45 # ...remaining for further processing : 24
% 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 : 2
% 0.16/0.45 # Generated clauses : 0
% 0.16/0.45 # ...of the previous two non-redundant : 0
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 0
% 0.16/0.45 # Paramodulations : 0
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 0
% 0.16/0.45 # Disequality decompositions : 0
% 0.16/0.45 # Total rewrite steps : 9
% 0.16/0.45 # ...of those cached : 6
% 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 : 22
% 0.16/0.45 # Positive orientable unit clauses : 9
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 11
% 0.16/0.45 # Non-unit-clauses : 2
% 0.16/0.45 # Current number of unprocessed clauses: 270
% 0.16/0.45 # ...number of literals in the above : 698
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 2
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.45 # Non-unit clause-clause subsumptions : 0
% 0.16/0.45 # Unit Clause-clause subsumption calls : 0
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 1
% 0.16/0.45 # BW rewrite match successes : 1
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 16076
% 0.16/0.45 # Search garbage collected termcells : 1042
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.006 s
% 0.16/0.45 # System time : 0.004 s
% 0.16/0.45 # Total time : 0.010 s
% 0.16/0.45 # Maximum resident set size: 2108 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.009 s
% 0.16/0.45 # System time : 0.006 s
% 0.16/0.45 # Total time : 0.015 s
% 0.16/0.45 # Maximum resident set size: 1792 pages
% 0.16/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------