TSTP Solution File: ALG173+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG173+1 : TPTP v8.2.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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.36s 0.56s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 178 ( 170 equ)
% Maximal formula atoms : 50 ( 11 avg)
% Number of connectives : 252 ( 89 ~; 13 |; 149 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 9 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(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 ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',ax5) ).
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/sandbox2/benchmark/theBenchmark.p',ax6) ).
fof(c_0_3,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_4,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(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 ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]),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]) ).
fof(c_0_6,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(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 ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,plain,
e4 = op(e3,op(e3,e3)),
inference(split_conjunct,[status(thm)],[ax6]) ).
cnf(c_0_8,plain,
e2 = op(e3,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(e3,op(e3,e3)) = e3,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
op(e3,e2) = e4,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
e3 != e4,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
e3 = e4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_8]),c_0_11]) ).
cnf(c_0_14,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.15 % Problem : ALG173+1 : TPTP v8.2.0. Released v2.7.0.
% 0.05/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n017.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Sat May 18 22:55:23 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.33/0.54 Running first-order model finding
% 0.33/0.54 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.36/0.56 # Version: 3.1.0
% 0.36/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.56 # Starting sh5l with 300s (1) cores
% 0.36/0.56 # sh5l with pid 4336 completed with status 0
% 0.36/0.56 # Result found by sh5l
% 0.36/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.56 # Starting sh5l with 300s (1) cores
% 0.36/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.36/0.56 # Search class: FGHSF-FSLM22-MFFFFFNN
% 0.36/0.56 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.56 # Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.36/0.56 # U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 4341 completed with status 0
% 0.36/0.56 # Result found by U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.36/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.56 # Starting sh5l with 300s (1) cores
% 0.36/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.36/0.56 # Search class: FGHSF-FSLM22-MFFFFFNN
% 0.36/0.56 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.56 # Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.36/0.56 # Preprocessing time : 0.003 s
% 0.36/0.56 # Presaturation interreduction done
% 0.36/0.56
% 0.36/0.56 # Proof found!
% 0.36/0.56 # SZS status Theorem
% 0.36/0.56 # SZS output start CNFRefutation
% See solution above
% 0.36/0.56 # Parsed axioms : 7
% 0.36/0.56 # Removed by relevancy pruning/SinE : 0
% 0.36/0.56 # Initial clauses : 294
% 0.36/0.56 # Removed in clause preprocessing : 0
% 0.36/0.56 # Initial clauses in saturation : 294
% 0.36/0.56 # Processed clauses : 20
% 0.36/0.56 # ...of these trivial : 0
% 0.36/0.56 # ...subsumed : 0
% 0.36/0.56 # ...remaining for further processing : 19
% 0.36/0.56 # Other redundant clauses eliminated : 0
% 0.36/0.56 # Clauses deleted for lack of memory : 0
% 0.36/0.56 # Backward-subsumed : 0
% 0.36/0.56 # Backward-rewritten : 5
% 0.36/0.56 # Generated clauses : 0
% 0.36/0.56 # ...of the previous two non-redundant : 5
% 0.36/0.56 # ...aggressively subsumed : 0
% 0.36/0.56 # Contextual simplify-reflections : 0
% 0.36/0.56 # Paramodulations : 0
% 0.36/0.56 # Factorizations : 0
% 0.36/0.56 # NegExts : 0
% 0.36/0.56 # Equation resolutions : 0
% 0.36/0.56 # Disequality decompositions : 0
% 0.36/0.56 # Total rewrite steps : 10
% 0.36/0.56 # ...of those cached : 7
% 0.36/0.56 # Propositional unsat checks : 0
% 0.36/0.56 # Propositional check models : 0
% 0.36/0.56 # Propositional check unsatisfiable : 0
% 0.36/0.56 # Propositional clauses : 0
% 0.36/0.56 # Propositional clauses after purity: 0
% 0.36/0.56 # Propositional unsat core size : 0
% 0.36/0.56 # Propositional preprocessing time : 0.000
% 0.36/0.56 # Propositional encoding time : 0.000
% 0.36/0.56 # Propositional solver time : 0.000
% 0.36/0.56 # Success case prop preproc time : 0.000
% 0.36/0.56 # Success case prop encoding time : 0.000
% 0.36/0.56 # Success case prop solver time : 0.000
% 0.36/0.56 # Current number of processed clauses : 14
% 0.36/0.56 # Positive orientable unit clauses : 7
% 0.36/0.56 # Positive unorientable unit clauses: 0
% 0.36/0.56 # Negative unit clauses : 6
% 0.36/0.56 # Non-unit-clauses : 1
% 0.36/0.56 # Current number of unprocessed clauses: 279
% 0.36/0.56 # ...number of literals in the above : 708
% 0.36/0.56 # Current number of archived formulas : 0
% 0.36/0.56 # Current number of archived clauses : 5
% 0.36/0.56 # Clause-clause subsumption calls (NU) : 0
% 0.36/0.56 # Rec. Clause-clause subsumption calls : 0
% 0.36/0.56 # Non-unit clause-clause subsumptions : 0
% 0.36/0.56 # Unit Clause-clause subsumption calls : 0
% 0.36/0.56 # Rewrite failures with RHS unbound : 0
% 0.36/0.56 # BW rewrite match attempts : 1
% 0.36/0.56 # BW rewrite match successes : 1
% 0.36/0.56 # Condensation attempts : 0
% 0.36/0.56 # Condensation successes : 0
% 0.36/0.56 # Termbank termtop insertions : 16075
% 0.36/0.56 # Search garbage collected termcells : 1042
% 0.36/0.56
% 0.36/0.56 # -------------------------------------------------
% 0.36/0.56 # User time : 0.007 s
% 0.36/0.56 # System time : 0.004 s
% 0.36/0.56 # Total time : 0.011 s
% 0.36/0.56 # Maximum resident set size: 2100 pages
% 0.36/0.56
% 0.36/0.56 # -------------------------------------------------
% 0.36/0.56 # User time : 0.012 s
% 0.36/0.56 # System time : 0.006 s
% 0.36/0.56 # Total time : 0.017 s
% 0.36/0.56 # Maximum resident set size: 1796 pages
% 0.36/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------