TSTP Solution File: KLE061+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE061+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:04:03 EDT 2023
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 28 unt; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 2 sgn; 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.y1CM7fCMKV/E---3.1_14818.p',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.y1CM7fCMKV/E---3.1_14818.p',multiplicative_left_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.y1CM7fCMKV/E---3.1_14818.p',additive_commutativity) ).
fof(domain3,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/export/starexec/sandbox2/tmp/tmp.y1CM7fCMKV/E---3.1_14818.p',domain3) ).
fof(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox2/tmp/tmp.y1CM7fCMKV/E---3.1_14818.p',domain1) ).
fof(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox2/tmp/tmp.y1CM7fCMKV/E---3.1_14818.p',domain2) ).
fof(goals,conjecture,
! [X4] : multiplication(domain(X4),domain(X4)) = domain(X4),
file('/export/starexec/sandbox2/tmp/tmp.y1CM7fCMKV/E---3.1_14818.p',goals) ).
fof(c_0_7,plain,
! [X21,X22,X23] : multiplication(addition(X21,X22),X23) = addition(multiplication(X21,X23),multiplication(X22,X23)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_8,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_9,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_10,plain,
! [X31] : addition(domain(X31),one) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_11,plain,
! [X28] : addition(X28,multiplication(domain(X28),X28)) = multiplication(domain(X28),X28),
inference(variable_rename,[status(thm)],[domain1]) ).
cnf(c_0_12,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X29,X30] : domain(multiplication(X29,X30)) = domain(multiplication(X29,domain(X30))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_17,negated_conjecture,
~ ! [X4] : multiplication(domain(X4),domain(X4)) = domain(X4),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_18,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_20,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_21,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,negated_conjecture,
multiplication(domain(esk1_0),domain(esk1_0)) != domain(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
cnf(c_0_23,plain,
multiplication(domain(X1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_14]),c_0_20]),c_0_13]) ).
cnf(c_0_24,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_13]),c_0_13]) ).
cnf(c_0_25,negated_conjecture,
multiplication(domain(esk1_0),domain(esk1_0)) != domain(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
multiplication(domain(X1),domain(X1)) = domain(X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE061+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n026.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 : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 05:05:59 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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/tmp/tmp.y1CM7fCMKV/E---3.1_14818.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 14896 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.20/0.50 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.50 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.20/0.50 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 14903 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.20/0.50 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 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 : 18
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 19
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 19
% 0.20/0.50 # Processed clauses : 87
% 0.20/0.50 # ...of these trivial : 17
% 0.20/0.50 # ...subsumed : 5
% 0.20/0.50 # ...remaining for further processing : 65
% 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 : 6
% 0.20/0.50 # Generated clauses : 701
% 0.20/0.50 # ...of the previous two non-redundant : 340
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 701
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 890
% 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 : 40
% 0.20/0.50 # Positive orientable unit clauses : 37
% 0.20/0.50 # Positive unorientable unit clauses: 1
% 0.20/0.50 # Negative unit clauses : 0
% 0.20/0.50 # Non-unit-clauses : 2
% 0.20/0.50 # Current number of unprocessed clauses: 291
% 0.20/0.50 # ...number of literals in the above : 291
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 25
% 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 : 1
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 49
% 0.20/0.50 # BW rewrite match successes : 25
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 6410
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.011 s
% 0.20/0.50 # Maximum resident set size: 1720 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.034 s
% 0.20/0.50 # System time : 0.014 s
% 0.20/0.50 # Total time : 0.048 s
% 0.20/0.50 # Maximum resident set size: 1688 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------