TSTP Solution File: BOO014-4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : BOO014-4 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 17:18:31 EDT 2023
% Result : Unsatisfiable 1.20s 0.57s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 9
% Syntax : Number of clauses : 59 ( 59 unt; 0 nHn; 3 RR)
% Number of literals : 59 ( 58 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 111 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity1,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.pHxwTF4ehx/E---3.1_32153.p',distributivity1) ).
cnf(additive_inverse1,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
file('/export/starexec/sandbox/tmp/tmp.pHxwTF4ehx/E---3.1_32153.p',additive_inverse1) ).
cnf(multiplicative_id1,axiom,
multiply(X1,multiplicative_identity) = X1,
file('/export/starexec/sandbox/tmp/tmp.pHxwTF4ehx/E---3.1_32153.p',multiplicative_id1) ).
cnf(multiplicative_inverse1,axiom,
multiply(X1,inverse(X1)) = additive_identity,
file('/export/starexec/sandbox/tmp/tmp.pHxwTF4ehx/E---3.1_32153.p',multiplicative_inverse1) ).
cnf(additive_id1,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox/tmp/tmp.pHxwTF4ehx/E---3.1_32153.p',additive_id1) ).
cnf(commutativity_of_multiply,axiom,
multiply(X1,X2) = multiply(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.pHxwTF4ehx/E---3.1_32153.p',commutativity_of_multiply) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.pHxwTF4ehx/E---3.1_32153.p',commutativity_of_add) ).
cnf(distributivity2,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.pHxwTF4ehx/E---3.1_32153.p',distributivity2) ).
cnf(prove_c_inverse_is_d,negated_conjecture,
inverse(add(a,b)) != multiply(inverse(a),inverse(b)),
file('/export/starexec/sandbox/tmp/tmp.pHxwTF4ehx/E---3.1_32153.p',prove_c_inverse_is_d) ).
cnf(c_0_9,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
distributivity1 ).
cnf(c_0_10,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
additive_inverse1 ).
cnf(c_0_11,axiom,
multiply(X1,multiplicative_identity) = X1,
multiplicative_id1 ).
cnf(c_0_12,plain,
add(X1,multiply(X2,inverse(X1))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_13,axiom,
multiply(X1,inverse(X1)) = additive_identity,
multiplicative_inverse1 ).
cnf(c_0_14,axiom,
add(X1,additive_identity) = X1,
additive_id1 ).
cnf(c_0_15,axiom,
multiply(X1,X2) = multiply(X2,X1),
commutativity_of_multiply ).
cnf(c_0_16,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,plain,
multiply(multiplicative_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_18,plain,
multiply(X1,add(X1,X2)) = add(X1,multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_19,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_20,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distributivity2 ).
cnf(c_0_21,plain,
add(X1,multiplicative_identity) = multiplicative_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17]),c_0_10]) ).
cnf(c_0_22,plain,
multiply(X1,add(X2,X1)) = add(X1,multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
add(X1,multiply(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_11]),c_0_21]),c_0_11]),c_0_19]) ).
cnf(c_0_24,plain,
multiply(X1,add(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
multiply(X1,multiply(X1,X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_15]) ).
cnf(c_0_26,plain,
multiply(X1,add(multiply(X1,X2),X3)) = multiply(X1,add(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_25]),c_0_20]) ).
cnf(c_0_27,plain,
add(multiply(X1,X2),multiply(X2,X3)) = multiply(X2,add(X1,X3)),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_28,plain,
add(X1,multiply(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_29,plain,
multiply(X1,multiply(X2,add(X1,X3))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23]) ).
cnf(c_0_30,plain,
add(X1,add(X2,X1)) = add(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_24]),c_0_19]) ).
cnf(c_0_31,plain,
multiply(X1,multiply(X2,add(X3,X1))) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
multiply(X1,multiply(add(X2,X1),X3)) = multiply(X1,X3),
inference(spm,[status(thm)],[c_0_31,c_0_15]) ).
cnf(c_0_33,plain,
add(X1,multiply(inverse(X1),X2)) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_17]) ).
cnf(c_0_34,plain,
multiply(multiply(X1,X2),multiply(X3,X1)) = multiply(multiply(X1,X2),X3),
inference(spm,[status(thm)],[c_0_31,c_0_23]) ).
cnf(c_0_35,plain,
multiply(multiply(X1,X2),multiply(X2,X3)) = multiply(multiply(X1,X2),X3),
inference(spm,[status(thm)],[c_0_32,c_0_28]) ).
cnf(c_0_36,plain,
add(additive_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_37,plain,
add(X1,inverse(inverse(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_13]),c_0_14]) ).
cnf(c_0_38,plain,
multiply(multiply(X1,X2),X3) = multiply(multiply(X2,X3),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_34]),c_0_35]) ).
cnf(c_0_39,plain,
multiply(X1,add(inverse(X1),X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_13]),c_0_36]) ).
cnf(c_0_40,plain,
multiply(X1,inverse(inverse(X1))) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_37]),c_0_15]) ).
cnf(c_0_41,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_15,c_0_38]) ).
cnf(c_0_42,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_10]),c_0_11]),c_0_40]) ).
cnf(c_0_43,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = additive_identity,
inference(spm,[status(thm)],[c_0_13,c_0_41]) ).
cnf(c_0_44,plain,
add(inverse(X1),multiply(X2,X1)) = add(inverse(X1),X2),
inference(spm,[status(thm)],[c_0_12,c_0_42]) ).
cnf(c_0_45,plain,
multiply(X1,multiply(inverse(X1),X2)) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_23]),c_0_13]) ).
cnf(c_0_46,plain,
multiply(X1,multiply(X2,inverse(X1))) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_28]),c_0_13]) ).
cnf(c_0_47,plain,
multiply(X1,add(X2,multiply(X1,X3))) = multiply(X1,add(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_25]),c_0_20]) ).
cnf(c_0_48,plain,
add(X1,multiply(X2,inverse(multiply(inverse(X1),X2)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_43]),c_0_14]) ).
cnf(c_0_49,plain,
add(X1,inverse(multiply(inverse(X1),X2))) = inverse(multiply(inverse(X1),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_14]),c_0_19]) ).
cnf(c_0_50,plain,
multiply(inverse(X1),multiply(X2,X1)) = additive_identity,
inference(spm,[status(thm)],[c_0_46,c_0_42]) ).
cnf(c_0_51,plain,
add(inverse(X1),multiply(X1,X2)) = add(inverse(X1),X2),
inference(spm,[status(thm)],[c_0_33,c_0_42]) ).
cnf(c_0_52,plain,
multiply(X1,inverse(multiply(inverse(X2),X1))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_53,plain,
add(inverse(X1),inverse(multiply(X2,X1))) = inverse(multiply(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_50]),c_0_14]),c_0_19]) ).
cnf(c_0_54,plain,
inverse(multiply(inverse(X1),X2)) = add(inverse(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_51]),c_0_53]) ).
cnf(c_0_55,plain,
inverse(add(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_42,c_0_54]) ).
cnf(c_0_56,negated_conjecture,
inverse(add(a,b)) != multiply(inverse(a),inverse(b)),
prove_c_inverse_is_d ).
cnf(c_0_57,plain,
multiply(inverse(X1),inverse(X2)) = inverse(add(X2,X1)),
inference(spm,[status(thm)],[c_0_55,c_0_42]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : BOO014-4 : TPTP v8.1.2. Released v1.1.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n019.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 20:40:51 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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/tmp/tmp.pHxwTF4ehx/E---3.1_32153.p
% 1.20/0.57 # Version: 3.1pre001
% 1.20/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 1.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 1.20/0.57 # Starting sh5l with 300s (1) cores
% 1.20/0.57 # new_bool_1 with pid 32232 completed with status 0
% 1.20/0.57 # Result found by new_bool_1
% 1.20/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 1.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 1.20/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.20/0.57 # Search class: FUUPM-FFSF21-SFFFFFNN
% 1.20/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.20/0.57 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.20/0.57 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 32236 completed with status 0
% 1.20/0.57 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.20/0.57 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.20/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.57 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.20/0.57 # Starting new_bool_3 with 300s (1) cores
% 1.20/0.57 # Starting new_bool_1 with 300s (1) cores
% 1.20/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.20/0.57 # Search class: FUUPM-FFSF21-SFFFFFNN
% 1.20/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.20/0.57 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.20/0.57 # Preprocessing time : 0.001 s
% 1.20/0.57 # Presaturation interreduction done
% 1.20/0.57
% 1.20/0.57 # Proof found!
% 1.20/0.57 # SZS status Unsatisfiable
% 1.20/0.57 # SZS output start CNFRefutation
% See solution above
% 1.20/0.57 # Parsed axioms : 9
% 1.20/0.57 # Removed by relevancy pruning/SinE : 0
% 1.20/0.57 # Initial clauses : 9
% 1.20/0.57 # Removed in clause preprocessing : 0
% 1.20/0.57 # Initial clauses in saturation : 9
% 1.20/0.57 # Processed clauses : 1199
% 1.20/0.57 # ...of these trivial : 772
% 1.20/0.57 # ...subsumed : 183
% 1.20/0.57 # ...remaining for further processing : 244
% 1.20/0.57 # Other redundant clauses eliminated : 0
% 1.20/0.57 # Clauses deleted for lack of memory : 0
% 1.20/0.57 # Backward-subsumed : 0
% 1.20/0.57 # Backward-rewritten : 97
% 1.20/0.57 # Generated clauses : 30685
% 1.20/0.57 # ...of the previous two non-redundant : 11243
% 1.20/0.57 # ...aggressively subsumed : 0
% 1.20/0.57 # Contextual simplify-reflections : 0
% 1.20/0.57 # Paramodulations : 30685
% 1.20/0.57 # Factorizations : 0
% 1.20/0.57 # NegExts : 0
% 1.20/0.57 # Equation resolutions : 0
% 1.20/0.57 # Total rewrite steps : 38022
% 1.20/0.57 # Propositional unsat checks : 0
% 1.20/0.57 # Propositional check models : 0
% 1.20/0.57 # Propositional check unsatisfiable : 0
% 1.20/0.57 # Propositional clauses : 0
% 1.20/0.57 # Propositional clauses after purity: 0
% 1.20/0.57 # Propositional unsat core size : 0
% 1.20/0.57 # Propositional preprocessing time : 0.000
% 1.20/0.57 # Propositional encoding time : 0.000
% 1.20/0.57 # Propositional solver time : 0.000
% 1.20/0.57 # Success case prop preproc time : 0.000
% 1.20/0.57 # Success case prop encoding time : 0.000
% 1.20/0.57 # Success case prop solver time : 0.000
% 1.20/0.57 # Current number of processed clauses : 138
% 1.20/0.57 # Positive orientable unit clauses : 136
% 1.20/0.57 # Positive unorientable unit clauses: 2
% 1.20/0.57 # Negative unit clauses : 0
% 1.20/0.57 # Non-unit-clauses : 0
% 1.20/0.57 # Current number of unprocessed clauses: 9807
% 1.20/0.57 # ...number of literals in the above : 9807
% 1.20/0.57 # Current number of archived formulas : 0
% 1.20/0.57 # Current number of archived clauses : 106
% 1.20/0.57 # Clause-clause subsumption calls (NU) : 0
% 1.20/0.57 # Rec. Clause-clause subsumption calls : 0
% 1.20/0.57 # Non-unit clause-clause subsumptions : 0
% 1.20/0.57 # Unit Clause-clause subsumption calls : 18
% 1.20/0.57 # Rewrite failures with RHS unbound : 0
% 1.20/0.57 # BW rewrite match attempts : 689
% 1.20/0.57 # BW rewrite match successes : 208
% 1.20/0.57 # Condensation attempts : 0
% 1.20/0.57 # Condensation successes : 0
% 1.20/0.57 # Termbank termtop insertions : 207439
% 1.20/0.57
% 1.20/0.57 # -------------------------------------------------
% 1.20/0.57 # User time : 0.145 s
% 1.20/0.57 # System time : 0.007 s
% 1.20/0.57 # Total time : 0.153 s
% 1.20/0.57 # Maximum resident set size: 1612 pages
% 1.20/0.57
% 1.20/0.57 # -------------------------------------------------
% 1.20/0.57 # User time : 0.146 s
% 1.20/0.57 # System time : 0.009 s
% 1.20/0.57 # Total time : 0.155 s
% 1.20/0.57 # Maximum resident set size: 1672 pages
% 1.20/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------