TSTP Solution File: KLE074+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE074+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:05 EDT 2023
% Result : Timeout 0.37s 300.13s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 13 unt; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] : domain(multiplication(multiplication(X4,X5),domain(X6))) = domain(multiplication(X4,domain(multiplication(X5,domain(X6))))),
file('/export/starexec/sandbox/tmp/tmp.2XiygVuetS/E---3.1_18857.p',goals) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.2XiygVuetS/E---3.1_18857.p',multiplicative_associativity) ).
fof(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox/tmp/tmp.2XiygVuetS/E---3.1_18857.p',domain2) ).
fof(c_0_3,negated_conjecture,
~ ! [X4,X5,X6] : domain(multiplication(multiplication(X4,X5),domain(X6))) = domain(multiplication(X4,domain(multiplication(X5,domain(X6))))),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_4,negated_conjecture,
domain(multiplication(multiplication(esk1_0,esk2_0),domain(esk3_0))) != domain(multiplication(esk1_0,domain(multiplication(esk2_0,domain(esk3_0))))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X14,X15,X16] : multiplication(X14,multiplication(X15,X16)) = multiplication(multiplication(X14,X15),X16),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_6,plain,
! [X30,X31] : domain(multiplication(X30,X31)) = domain(multiplication(X30,domain(X31))),
inference(variable_rename,[status(thm)],[domain2]) ).
cnf(c_0_7,negated_conjecture,
domain(multiplication(multiplication(esk1_0,esk2_0),domain(esk3_0))) != domain(multiplication(esk1_0,domain(multiplication(esk2_0,domain(esk3_0))))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
domain(multiplication(esk1_0,multiplication(esk2_0,domain(esk3_0)))) != domain(multiplication(esk1_0,multiplication(esk2_0,esk3_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_9]) ).
cnf(c_0_11,plain,
domain(multiplication(X1,multiplication(X2,domain(X3)))) = domain(multiplication(X1,multiplication(X2,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_9]),c_0_9]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KLE074+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n020.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 : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 04:44:31 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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/tmp/tmp.2XiygVuetS/E---3.1_18857.p
% 0.37/300.13 # Version: 3.1pre001
% 0.37/300.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.37/300.13 # Starting new_bool_1 with 300s (1) cores
% 0.37/300.13 # Starting sh5l with 300s (1) cores
% 0.37/300.13 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18997 completed with status 0
% 0.37/300.13 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.37/300.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/300.13 # No SInE strategy applied
% 0.37/300.13 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.37/300.13 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/300.13 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.37/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.37/300.13 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.37/300.13 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.37/300.13 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 0.37/300.13 # G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with pid 19003 completed with status 0
% 0.37/300.13 # Result found by G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y
% 0.37/300.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/300.13 # No SInE strategy applied
% 0.37/300.13 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.37/300.13 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/300.13 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.37/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.37/300.13 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.37/300.13 # Preprocessing time : 0.001 s
% 0.37/300.13 # Presaturation interreduction done
% 0.37/300.13
% 0.37/300.13 # Proof found!
% 0.37/300.13 # SZS status Theorem
% 0.37/300.13 # SZS output start CNFRefutation
% See solution above
% 0.37/300.13 # Parsed axioms : 18
% 0.37/300.13 # Removed by relevancy pruning/SinE : 0
% 0.37/300.13 # Initial clauses : 19
% 0.37/300.13 # Removed in clause preprocessing : 0
% 0.37/300.13 # Initial clauses in saturation : 19
% 0.37/300.13 # Processed clauses : 43
% 0.37/300.13 # ...of these trivial : 2
% 0.37/300.13 # ...subsumed : 0
% 0.37/300.13 # ...remaining for further processing : 41
% 0.37/300.13 # Other redundant clauses eliminated : 0
% 0.37/300.13 # Clauses deleted for lack of memory : 0
% 0.37/300.13 # Backward-subsumed : 0
% 0.37/300.13 # Backward-rewritten : 2
% 0.37/300.13 # Generated clauses : 70
% 0.37/300.13 # ...of the previous two non-redundant : 25
% 0.37/300.13 # ...aggressively subsumed : 0
% 0.37/300.13 # Contextual simplify-reflections : 0
% 0.37/300.13 # Paramodulations : 70
% 0.37/300.13 # Factorizations : 0
% 0.37/300.13 # NegExts : 0
% 0.37/300.13 # Equation resolutions : 0
% 0.37/300.13 # Total rewrite steps : 73
% 0.37/300.13 # Propositional unsat checks : 0
% 0.37/300.13 # Propositional check models : 0
% 0.37/300.13 # Propositional check unsatisfiable : 0
% 0.37/300.13 # Propositional clauses : 0
% 0.37/300.13 # Propositional clauses after purity: 0
% 0.37/300.13 # Propositional unsat core size : 0
% 0.37/300.13 # Propositional preprocessing time : 0.000
% 0.37/300.13 # Propositional encoding time : 0.000
% 0.37/300.13 # Propositional solver time : 0.000
% 0.37/300.13 # Success case prop preproc time : 0.000
% 0.37/300.13 # Success case prop encoding time : 0.000
% 0.37/300.13 # Success case prop solver time : 0.000
% 0.37/300.13 # Current number of processed clauses : 20
% 0.37/300.13 # Positive orientable unit clauses : 17
% 0.37/300.13 # Positive unorientable unit clauses: 1
% 0.37/300.13 # Negative unit clauses : 0
% 0.37/300.13 # Non-unit-clauses : 2
% 0.37/300.13 # Current number of unprocessed clauses: 20
% 0.37/300.13 # ...number of literals in the above : 20
% 0.37/300.13 # Current number of archived formulas : 0
% 0.37/300.13 # Current number of archived clauses : 21
% 0.37/300.13 # Clause-clause subsumption calls (NU) : 0
% 0.37/300.13 # Rec. Clause-clause subsumption calls : 0
% 0.37/300.13 # Non-unit clause-clause subsumptions : 0
% 0.37/300.13 # Unit Clause-clause subsumption calls : 0
% 0.37/300.13 # Rewrite failures with RHS unbound : 0
% 0.37/300.13 # BW rewrite match attempts : 15
% 0.37/300.13 # BW rewrite match successes : 11
% 0.37/300.13 # Condensation attempts : 43
% 0.37/300.13 # Condensation successes : 0
% 0.37/300.13 # Termbank termtop insertions : 1398
% 0.37/300.13
% 0.37/300.13 # -------------------------------------------------
% 0.37/300.13 # User time : 0.006 s
% 0.37/300.13 # System time : 0.001 s
% 0.37/300.13 # Total time : 0.007 s
% 0.37/300.13 # Maximum resident set size: 1732 pages
% 0.37/300.13
% 0.37/300.13 # -------------------------------------------------
% 0.37/300.13 # User time : 0.017 s
% 0.37/300.13 # System time : 0.013 s
% 0.37/300.13 # Total time : 0.030 s
% 0.37/300.13 # Maximum resident set size: 1688 pages
% 0.37/300.13 % E---3.1 exiting
% 0.37/300.13 % E---3.1 exiting
%------------------------------------------------------------------------------