TSTP Solution File: ALG014+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ALG014+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 18:06:27 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 7 unt; 0 def)
% Number of atoms : 107 ( 96 equ)
% Maximal formula atoms : 32 ( 6 avg)
% Number of connectives : 119 ( 28 ~; 23 |; 67 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 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(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(ax11,axiom,
( e0 != e1
& e0 != e2
& e0 != e3
& e1 != e2
& e1 != e3
& e2 != e3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax11) ).
fof(ax3,axiom,
( op(unit,e0) = e0
& op(e0,unit) = e0
& op(unit,e1) = e1
& op(e1,unit) = e1
& op(unit,e2) = e2
& op(e2,unit) = e2
& op(unit,e3) = e3
& op(e3,unit) = e3
& ( unit = e0
| unit = e1
| unit = e2
| unit = e3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(ax5,axiom,
unit = e0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
fof(c_0_4,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_5,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_4]),c_0_4]) ).
fof(c_0_6,plain,
( e0 != e1
& e0 != e2
& e0 != e3
& e1 != e2
& e1 != e3
& e2 != e3 ),
inference(fof_simplification,[status(thm)],[ax11]) ).
fof(c_0_7,negated_conjecture,
( ~ epred1_0
& ( op(e0,e0) != e3
| op(e1,e1) != e3
| op(e2,e2) != e3
| op(e3,e3) != e3 )
& ( op(e0,e0) = e3
| epred1_0 )
& ( op(e1,e1) = e3
| epred1_0 )
& ( op(e2,e2) = e3
| epred1_0 )
& ( op(e3,e3) = e3
| epred1_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_8,plain,
op(e0,unit) = e0,
inference(split_conjunct,[status(thm)],[ax3]) ).
cnf(c_0_9,plain,
unit = e0,
inference(split_conjunct,[status(thm)],[ax5]) ).
fof(c_0_10,plain,
( e0 != e1
& e0 != e2
& e0 != e3
& e1 != e2
& e1 != e3
& e2 != e3 ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( op(e0,e0) = e3
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
op(e0,e0) = e0,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
e0 != e3,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ epred1_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG014+1 : TPTP v8.2.0. Released v2.7.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 22:46:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 7433 completed with status 0
% 0.20/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGHSF-FSLM21-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.50 # Starting sh5l with 136s (1) cores
% 0.20/0.50 # new_bool_3 with pid 7439 completed with status 0
% 0.20/0.50 # Result found by new_bool_3
% 0.20/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGHSF-FSLM21-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.50 # Preprocessing time : 0.002 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 12
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 252
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 252
% 0.20/0.50 # Processed clauses : 51
% 0.20/0.50 # ...of these trivial : 3
% 0.20/0.50 # ...subsumed : 8
% 0.20/0.50 # ...remaining for further processing : 39
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 13
% 0.20/0.50 # Generated clauses : 0
% 0.20/0.50 # ...of the previous two non-redundant : 13
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 0
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 39
% 0.20/0.50 # ...of those cached : 32
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 26
% 0.20/0.50 # Positive orientable unit clauses : 10
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 16
% 0.20/0.50 # Non-unit-clauses : 0
% 0.20/0.50 # Current number of unprocessed clauses: 214
% 0.20/0.50 # ...number of literals in the above : 496
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 13
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 2
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 4
% 0.20/0.50 # BW rewrite match successes : 4
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 10944
% 0.20/0.50 # Search garbage collected termcells : 797
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.008 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.011 s
% 0.20/0.50 # Maximum resident set size: 2088 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.023 s
% 0.20/0.50 # System time : 0.009 s
% 0.20/0.50 # Total time : 0.032 s
% 0.20/0.50 # Maximum resident set size: 1756 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------