TSTP Solution File: KLE063+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KLE063+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:10:55 EDT 2024
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 42 unt; 0 def)
% Number of atoms : 48 ( 47 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 64 ( 5 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain2) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_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(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/KLE001+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/KLE001+0.ax',multiplicative_right_identity) ).
fof(goals,conjecture,
! [X4,X5] :
( addition(X4,multiplication(domain(X5),X4)) = multiplication(domain(X5),X4)
=> addition(domain(X4),domain(X5)) = domain(X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(c_0_10,plain,
! [X9,X10] : domain(multiplication(X9,X10)) = domain(multiplication(X9,domain(X10))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_11,plain,
! [X31] : multiplication(one,X31) = X31,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_12,plain,
! [X12,X13] : domain(addition(X12,X13)) = addition(domain(X12),domain(X13)),
inference(variable_rename,[status(thm)],[domain5]) ).
cnf(c_0_13,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X11] : addition(domain(X11),one) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_16,plain,
! [X14,X15] : addition(X14,X15) = addition(X15,X14),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_17,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_19,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X8] : addition(X8,multiplication(domain(X8),X8)) = multiplication(domain(X8),X8),
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_22,plain,
! [X30] : multiplication(X30,one) = X30,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_23,negated_conjecture,
~ ! [X4,X5] :
( addition(X4,multiplication(domain(X5),X4)) = multiplication(domain(X5),X4)
=> addition(domain(X4),domain(X5)) = domain(X5) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_24,plain,
! [X24,X25,X26] : multiplication(addition(X24,X25),X26) = addition(multiplication(X24,X26),multiplication(X25,X26)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_25,plain,
domain(addition(X1,domain(X2))) = domain(addition(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_17]) ).
cnf(c_0_26,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_29,plain,
! [X21,X22,X23] : multiplication(X21,addition(X22,X23)) = addition(multiplication(X21,X22),multiplication(X21,X23)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_30,negated_conjecture,
( addition(esk1_0,multiplication(domain(esk2_0),esk1_0)) = multiplication(domain(esk2_0),esk1_0)
& addition(domain(esk1_0),domain(esk2_0)) != domain(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])]) ).
cnf(c_0_31,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
domain(addition(one,X1)) = domain(one),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
domain(one) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26]) ).
cnf(c_0_34,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,negated_conjecture,
addition(esk1_0,multiplication(domain(esk2_0),esk1_0)) = multiplication(domain(esk2_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_14]),c_0_20]) ).
cnf(c_0_37,plain,
domain(addition(one,X1)) = one,
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_28]),c_0_20]) ).
cnf(c_0_39,negated_conjecture,
multiplication(domain(esk2_0),esk1_0) = esk1_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_20]),c_0_26]),c_0_14]) ).
cnf(c_0_40,negated_conjecture,
addition(domain(esk1_0),domain(esk2_0)) != domain(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,plain,
domain(multiplication(X1,addition(one,X2))) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_37]),c_0_28]) ).
cnf(c_0_42,negated_conjecture,
multiplication(domain(esk2_0),addition(one,esk1_0)) = addition(esk1_0,domain(esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_20]),c_0_20]) ).
cnf(c_0_43,negated_conjecture,
domain(addition(esk1_0,esk2_0)) != domain(esk2_0),
inference(rw,[status(thm)],[c_0_40,c_0_17]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_25]),c_0_18]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KLE063+1 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 09:48:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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.21/0.53 # Version: 3.1.0
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # sh5l with pid 25497 completed with status 0
% 0.21/0.53 # Result found by sh5l
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.53 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.21/0.53 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.21/0.53 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 25503 completed with status 0
% 0.21/0.53 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.21/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.53 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.21/0.53 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 18
% 0.21/0.53 # Removed by relevancy pruning/SinE : 1
% 0.21/0.53 # Initial clauses : 18
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 18
% 0.21/0.53 # Processed clauses : 133
% 0.21/0.53 # ...of these trivial : 36
% 0.21/0.53 # ...subsumed : 17
% 0.21/0.53 # ...remaining for further processing : 80
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 0
% 0.21/0.53 # Backward-rewritten : 5
% 0.21/0.53 # Generated clauses : 1145
% 0.21/0.53 # ...of the previous two non-redundant : 499
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 1145
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 1770
% 0.21/0.53 # ...of those cached : 1262
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 57
% 0.21/0.53 # Positive orientable unit clauses : 55
% 0.21/0.53 # Positive unorientable unit clauses: 1
% 0.21/0.53 # Negative unit clauses : 1
% 0.21/0.53 # Non-unit-clauses : 0
% 0.21/0.53 # Current number of unprocessed clauses: 386
% 0.21/0.53 # ...number of literals in the above : 386
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 23
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.53 # Non-unit clause-clause subsumptions : 0
% 0.21/0.53 # Unit Clause-clause subsumption calls : 0
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 40
% 0.21/0.53 # BW rewrite match successes : 19
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 10663
% 0.21/0.53 # Search garbage collected termcells : 35
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.013 s
% 0.21/0.53 # System time : 0.003 s
% 0.21/0.53 # Total time : 0.016 s
% 0.21/0.53 # Maximum resident set size: 1748 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.014 s
% 0.21/0.53 # System time : 0.006 s
% 0.21/0.53 # Total time : 0.020 s
% 0.21/0.53 # Maximum resident set size: 1708 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------