TSTP Solution File: KLE093+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KLE093+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 23:11:02 EDT 2024
% Result : Theorem 0.36s 0.55s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 31 unt; 0 def)
% Number of atoms : 39 ( 31 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 11 ( 6 ~; 3 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 4 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(domain3,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain3) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_commutativity) ).
fof(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',multiplicative_right_identity) ).
fof(domain5,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain5) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',order) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_unfold_right) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',additive_associativity) ).
fof(goals,conjecture,
! [X4] : domain(star(X4)) = one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(c_0_9,plain,
! [X39] : addition(domain(X39),one) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_10,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_11,plain,
! [X36] : addition(X36,multiplication(domain(X36),X36)) = multiplication(domain(X36),X36),
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_12,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_13,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X40,X41] : domain(addition(X40,X41)) = addition(domain(X40),domain(X41)),
inference(variable_rename,[status(thm)],[domain5]) ).
cnf(c_0_16,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_19,plain,
! [X26,X27] :
( ( ~ leq(X26,X27)
| addition(X26,X27) = X27 )
& ( addition(X26,X27) != X27
| leq(X26,X27) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
fof(c_0_20,plain,
! [X28] : leq(addition(one,multiplication(X28,star(X28))),star(X28)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
fof(c_0_21,plain,
! [X8,X9,X10] : addition(X10,addition(X9,X8)) = addition(addition(X10,X9),X8),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_22,negated_conjecture,
~ ! [X4] : domain(star(X4)) = one,
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_23,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
domain(one) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_25,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_28,negated_conjecture,
domain(star(esk1_0)) != one,
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
cnf(c_0_29,plain,
domain(addition(one,X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18]) ).
cnf(c_0_30,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_14]) ).
cnf(c_0_31,negated_conjecture,
domain(star(esk1_0)) != one,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
domain(star(X1)) = one,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : KLE093+1 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n004.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sun May 19 09:52:53 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.36/0.55 # Version: 3.1.0
% 0.36/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.55 # Starting sh5l with 300s (1) cores
% 0.36/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21182 completed with status 0
% 0.36/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.36/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.55 # No SInE strategy applied
% 0.36/0.55 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.36/0.55 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/0.55 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.36/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.36/0.55 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.36/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.36/0.55 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 0.36/0.55 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with pid 21192 completed with status 0
% 0.36/0.55 # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U
% 0.36/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.55 # No SInE strategy applied
% 0.36/0.55 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.36/0.55 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/0.55 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.36/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.36/0.55 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.36/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.36/0.55 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 0.36/0.55 # Preprocessing time : 0.001 s
% 0.36/0.55 # Presaturation interreduction done
% 0.36/0.55
% 0.36/0.55 # Proof found!
% 0.36/0.55 # SZS status Theorem
% 0.36/0.55 # SZS output start CNFRefutation
% See solution above
% 0.36/0.55 # Parsed axioms : 22
% 0.36/0.55 # Removed by relevancy pruning/SinE : 0
% 0.36/0.55 # Initial clauses : 23
% 0.36/0.55 # Removed in clause preprocessing : 0
% 0.36/0.55 # Initial clauses in saturation : 23
% 0.36/0.55 # Processed clauses : 128
% 0.36/0.55 # ...of these trivial : 24
% 0.36/0.55 # ...subsumed : 9
% 0.36/0.55 # ...remaining for further processing : 95
% 0.36/0.55 # Other redundant clauses eliminated : 0
% 0.36/0.55 # Clauses deleted for lack of memory : 0
% 0.36/0.55 # Backward-subsumed : 1
% 0.36/0.55 # Backward-rewritten : 12
% 0.36/0.55 # Generated clauses : 651
% 0.36/0.55 # ...of the previous two non-redundant : 327
% 0.36/0.55 # ...aggressively subsumed : 0
% 0.36/0.55 # Contextual simplify-reflections : 0
% 0.36/0.55 # Paramodulations : 651
% 0.36/0.55 # Factorizations : 0
% 0.36/0.55 # NegExts : 0
% 0.36/0.55 # Equation resolutions : 0
% 0.36/0.55 # Disequality decompositions : 0
% 0.36/0.55 # Total rewrite steps : 693
% 0.36/0.55 # ...of those cached : 447
% 0.36/0.55 # Propositional unsat checks : 0
% 0.36/0.55 # Propositional check models : 0
% 0.36/0.55 # Propositional check unsatisfiable : 0
% 0.36/0.55 # Propositional clauses : 0
% 0.36/0.55 # Propositional clauses after purity: 0
% 0.36/0.55 # Propositional unsat core size : 0
% 0.36/0.55 # Propositional preprocessing time : 0.000
% 0.36/0.55 # Propositional encoding time : 0.000
% 0.36/0.55 # Propositional solver time : 0.000
% 0.36/0.55 # Success case prop preproc time : 0.000
% 0.36/0.55 # Success case prop encoding time : 0.000
% 0.36/0.55 # Success case prop solver time : 0.000
% 0.36/0.55 # Current number of processed clauses : 59
% 0.36/0.55 # Positive orientable unit clauses : 48
% 0.36/0.55 # Positive unorientable unit clauses: 1
% 0.36/0.55 # Negative unit clauses : 0
% 0.36/0.55 # Non-unit-clauses : 10
% 0.36/0.55 # Current number of unprocessed clauses: 233
% 0.36/0.55 # ...number of literals in the above : 291
% 0.36/0.55 # Current number of archived formulas : 0
% 0.36/0.55 # Current number of archived clauses : 36
% 0.36/0.55 # Clause-clause subsumption calls (NU) : 25
% 0.36/0.55 # Rec. Clause-clause subsumption calls : 25
% 0.36/0.55 # Non-unit clause-clause subsumptions : 7
% 0.36/0.55 # Unit Clause-clause subsumption calls : 1
% 0.36/0.55 # Rewrite failures with RHS unbound : 0
% 0.36/0.55 # BW rewrite match attempts : 48
% 0.36/0.55 # BW rewrite match successes : 23
% 0.36/0.55 # Condensation attempts : 0
% 0.36/0.55 # Condensation successes : 0
% 0.36/0.55 # Termbank termtop insertions : 6750
% 0.36/0.55 # Search garbage collected termcells : 57
% 0.36/0.55
% 0.36/0.55 # -------------------------------------------------
% 0.36/0.55 # User time : 0.009 s
% 0.36/0.55 # System time : 0.004 s
% 0.36/0.55 # Total time : 0.013 s
% 0.36/0.55 # Maximum resident set size: 1744 pages
% 0.36/0.55
% 0.36/0.55 # -------------------------------------------------
% 0.36/0.55 # User time : 0.041 s
% 0.36/0.55 # System time : 0.015 s
% 0.36/0.55 # Total time : 0.056 s
% 0.36/0.55 # Maximum resident set size: 1712 pages
% 0.36/0.55 % E---3.1 exiting
% 0.36/0.55 % E exiting
%------------------------------------------------------------------------------