TSTP Solution File: ALG017+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ALG017+1 : TPTP v8.2.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 17:59:11 EDT 2024
% Result : Theorem 0.43s 0.55s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 94 ( 83 equ)
% Maximal formula atoms : 32 ( 7 avg)
% Number of connectives : 111 ( 30 ~; 18 |; 62 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
~ ( ( ( op(e0,e0) = e0
& op(e1,e1) = e0
& op(e2,e2) = e0
& op(e3,e3) = e0 )
| ( op(e0,e0) = e1
& op(e1,e1) = e1
& op(e2,e2) = e1
& op(e3,e3) = e1 )
| ( op(e0,e0) = e2
& op(e1,e1) = e2
& op(e2,e2) = e2
& op(e3,e3) = e2 )
| ( op(e0,e0) = e3
& op(e1,e1) = e3
& op(e2,e2) = e3
& op(e3,e3) = e3 ) )
& ~ ( ( op(e0,e0) = e0
& op(e1,e1) = e0
& op(e2,e2) = e0
& op(e3,e3) = e0 )
| ( op(e0,e0) = e1
& op(e1,e1) = e1
& op(e2,e2) = e1
& op(e3,e3) = e1 )
| ( op(e0,e0) = e2
& op(e1,e1) = e2
& op(e2,e2) = e2
& op(e3,e3) = e2 )
| ( op(e0,e0) = e3
& op(e1,e1) = e3
& op(e2,e2) = e3
& op(e3,e3) = e3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax10,axiom,
( e0 != e1
& e0 != e2
& e0 != e3
& e1 != e2
& e1 != e3
& e2 != e3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax10) ).
fof(ax11,axiom,
( e0 = op(e3,e3)
& e1 = op(e2,e3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax11) ).
fof(c_0_3,plain,
( epred1_0
<=> ( ( op(e0,e0) = e0
& op(e1,e1) = e0
& op(e2,e2) = e0
& op(e3,e3) = e0 )
| ( op(e0,e0) = e1
& op(e1,e1) = e1
& op(e2,e2) = e1
& op(e3,e3) = e1 )
| ( op(e0,e0) = e2
& op(e1,e1) = e2
& op(e2,e2) = e2
& op(e3,e3) = e2 ) ) ),
introduced(definition) ).
fof(c_0_4,negated_conjecture,
~ ~ ( ( epred1_0
| ( op(e0,e0) = e3
& op(e1,e1) = e3
& op(e2,e2) = e3
& op(e3,e3) = e3 ) )
& ~ ( epred1_0
| ( op(e0,e0) = e3
& op(e1,e1) = e3
& op(e2,e2) = e3
& op(e3,e3) = e3 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[co1]),c_0_3]),c_0_3]) ).
fof(c_0_5,plain,
( e0 != e1
& e0 != e2
& e0 != e3
& e1 != e2
& e1 != e3
& e2 != e3 ),
inference(fof_simplification,[status(thm)],[ax10]) ).
fof(c_0_6,negated_conjecture,
( ( op(e0,e0) = e3
| epred1_0 )
& ( op(e1,e1) = e3
| epred1_0 )
& ( op(e2,e2) = e3
| epred1_0 )
& ( op(e3,e3) = e3
| epred1_0 )
& ~ epred1_0
& ( op(e0,e0) != e3
| op(e1,e1) != e3
| op(e2,e2) != e3
| op(e3,e3) != e3 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
( e0 != e1
& e0 != e2
& e0 != e3
& e1 != e2
& e1 != e3
& e2 != e3 ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( op(e3,e3) = e3
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
e0 = op(e3,e3),
inference(split_conjunct,[status(thm)],[ax11]) ).
cnf(c_0_10,plain,
e0 != e3,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
~ epred1_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : ALG017+1 : TPTP v8.2.0. Released v2.7.0.
% 0.15/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n015.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 : Sat May 18 23:33:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.53 Running first-order theorem proving
% 0.22/0.53 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.43/0.55 # Version: 3.1.0
% 0.43/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.43/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.43/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.43/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.43/0.55 # Starting sh5l with 300s (1) cores
% 0.43/0.55 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 20743 completed with status 0
% 0.43/0.55 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.43/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.43/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.43/0.55 # No SInE strategy applied
% 0.43/0.55 # Search class: FGHSF-FSLM21-SFFFFFNN
% 0.43/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.43/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.43/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.43/0.55 # Starting new_bool_3 with 136s (1) cores
% 0.43/0.55 # Starting new_bool_1 with 136s (1) cores
% 0.43/0.55 # Starting sh5l with 136s (1) cores
% 0.43/0.55 # SAT001_MinMin_p005000_rr_RG with pid 20747 completed with status 0
% 0.43/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.43/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.43/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.43/0.55 # No SInE strategy applied
% 0.43/0.55 # Search class: FGHSF-FSLM21-SFFFFFNN
% 0.43/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.43/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.43/0.55 # Preprocessing time : 0.003 s
% 0.43/0.55 # Presaturation interreduction done
% 0.43/0.55
% 0.43/0.55 # Proof found!
% 0.43/0.55 # SZS status Theorem
% 0.43/0.55 # SZS output start CNFRefutation
% See solution above
% 0.43/0.55 # Parsed axioms : 12
% 0.43/0.55 # Removed by relevancy pruning/SinE : 0
% 0.43/0.55 # Initial clauses : 253
% 0.43/0.55 # Removed in clause preprocessing : 0
% 0.43/0.55 # Initial clauses in saturation : 253
% 0.43/0.55 # Processed clauses : 95
% 0.43/0.55 # ...of these trivial : 0
% 0.43/0.55 # ...subsumed : 7
% 0.43/0.55 # ...remaining for further processing : 87
% 0.43/0.55 # Other redundant clauses eliminated : 0
% 0.43/0.55 # Clauses deleted for lack of memory : 0
% 0.43/0.55 # Backward-subsumed : 0
% 0.43/0.55 # Backward-rewritten : 17
% 0.43/0.55 # Generated clauses : 0
% 0.43/0.55 # ...of the previous two non-redundant : 17
% 0.43/0.55 # ...aggressively subsumed : 0
% 0.43/0.55 # Contextual simplify-reflections : 0
% 0.43/0.55 # Paramodulations : 0
% 0.43/0.55 # Factorizations : 0
% 0.43/0.55 # NegExts : 0
% 0.43/0.55 # Equation resolutions : 0
% 0.43/0.55 # Disequality decompositions : 0
% 0.43/0.55 # Total rewrite steps : 25
% 0.43/0.55 # ...of those cached : 20
% 0.43/0.55 # Propositional unsat checks : 0
% 0.43/0.55 # Propositional check models : 0
% 0.43/0.55 # Propositional check unsatisfiable : 0
% 0.43/0.55 # Propositional clauses : 0
% 0.43/0.55 # Propositional clauses after purity: 0
% 0.43/0.55 # Propositional unsat core size : 0
% 0.43/0.55 # Propositional preprocessing time : 0.000
% 0.43/0.55 # Propositional encoding time : 0.000
% 0.43/0.55 # Propositional solver time : 0.000
% 0.43/0.55 # Success case prop preproc time : 0.000
% 0.43/0.55 # Success case prop encoding time : 0.000
% 0.43/0.55 # Success case prop solver time : 0.000
% 0.43/0.55 # Current number of processed clauses : 70
% 0.43/0.55 # Positive orientable unit clauses : 18
% 0.43/0.55 # Positive unorientable unit clauses: 0
% 0.43/0.55 # Negative unit clauses : 49
% 0.43/0.55 # Non-unit-clauses : 3
% 0.43/0.55 # Current number of unprocessed clauses: 175
% 0.43/0.55 # ...number of literals in the above : 452
% 0.43/0.55 # Current number of archived formulas : 0
% 0.43/0.55 # Current number of archived clauses : 17
% 0.43/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.43/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.43/0.55 # Non-unit clause-clause subsumptions : 0
% 0.43/0.55 # Unit Clause-clause subsumption calls : 68
% 0.43/0.55 # Rewrite failures with RHS unbound : 0
% 0.43/0.55 # BW rewrite match attempts : 3
% 0.43/0.55 # BW rewrite match successes : 3
% 0.43/0.55 # Condensation attempts : 0
% 0.43/0.55 # Condensation successes : 0
% 0.43/0.55 # Termbank termtop insertions : 10962
% 0.43/0.55 # Search garbage collected termcells : 795
% 0.43/0.55
% 0.43/0.55 # -------------------------------------------------
% 0.43/0.55 # User time : 0.009 s
% 0.43/0.55 # System time : 0.004 s
% 0.43/0.55 # Total time : 0.013 s
% 0.43/0.55 # Maximum resident set size: 2088 pages
% 0.43/0.55
% 0.43/0.55 # -------------------------------------------------
% 0.43/0.55 # User time : 0.029 s
% 0.43/0.55 # System time : 0.009 s
% 0.43/0.55 # Total time : 0.038 s
% 0.43/0.55 # Maximum resident set size: 1756 pages
% 0.43/0.55 % E---3.1 exiting
% 0.43/0.55 % E exiting
%------------------------------------------------------------------------------