TSTP Solution File: BOO013-4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : BOO013-4 : TPTP v8.1.2. Released v1.1.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 17:18:10 EDT 2023
% Result : Unsatisfiable 0.15s 0.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 42 ( 42 unt; 0 nHn; 10 RR)
% Number of literals : 42 ( 41 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 51 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distributivity1,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.hyV4hUQQ7c/E---3.1_24728.p',distributivity1) ).
cnf(additive_inverse1,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
file('/export/starexec/sandbox/tmp/tmp.hyV4hUQQ7c/E---3.1_24728.p',additive_inverse1) ).
cnf(multiplicative_id1,axiom,
multiply(X1,multiplicative_identity) = X1,
file('/export/starexec/sandbox/tmp/tmp.hyV4hUQQ7c/E---3.1_24728.p',multiplicative_id1) ).
cnf(multiplicative_inverse1,axiom,
multiply(X1,inverse(X1)) = additive_identity,
file('/export/starexec/sandbox/tmp/tmp.hyV4hUQQ7c/E---3.1_24728.p',multiplicative_inverse1) ).
cnf(additive_id1,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox/tmp/tmp.hyV4hUQQ7c/E---3.1_24728.p',additive_id1) ).
cnf(commutativity_of_multiply,axiom,
multiply(X1,X2) = multiply(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.hyV4hUQQ7c/E---3.1_24728.p',commutativity_of_multiply) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.hyV4hUQQ7c/E---3.1_24728.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.hyV4hUQQ7c/E---3.1_24728.p',distributivity2) ).
cnf(b_a_multiplicative_identity,hypothesis,
add(a,b) = multiplicative_identity,
file('/export/starexec/sandbox/tmp/tmp.hyV4hUQQ7c/E---3.1_24728.p',b_a_multiplicative_identity) ).
cnf(b_an_additive_identity,hypothesis,
multiply(a,b) = additive_identity,
file('/export/starexec/sandbox/tmp/tmp.hyV4hUQQ7c/E---3.1_24728.p',b_an_additive_identity) ).
cnf(prove_a_inverse_is_b,negated_conjecture,
b != inverse(a),
file('/export/starexec/sandbox/tmp/tmp.hyV4hUQQ7c/E---3.1_24728.p',prove_a_inverse_is_b) ).
cnf(c_0_11,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
distributivity1 ).
cnf(c_0_12,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
additive_inverse1 ).
cnf(c_0_13,axiom,
multiply(X1,multiplicative_identity) = X1,
multiplicative_id1 ).
cnf(c_0_14,plain,
add(X1,multiply(X2,inverse(X1))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,axiom,
multiply(X1,inverse(X1)) = additive_identity,
multiplicative_inverse1 ).
cnf(c_0_16,axiom,
add(X1,additive_identity) = X1,
additive_id1 ).
cnf(c_0_17,axiom,
multiply(X1,X2) = multiply(X2,X1),
commutativity_of_multiply ).
cnf(c_0_18,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
multiply(multiplicative_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_20,plain,
multiply(X1,add(X1,X2)) = add(X1,multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_21,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_22,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distributivity2 ).
cnf(c_0_23,plain,
add(X1,multiplicative_identity) = multiplicative_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_19]),c_0_12]) ).
cnf(c_0_24,hypothesis,
add(a,b) = multiplicative_identity,
b_a_multiplicative_identity ).
cnf(c_0_25,plain,
multiply(X1,add(X2,X1)) = add(X1,multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,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_22,c_0_13]),c_0_23]),c_0_13]),c_0_21]) ).
cnf(c_0_27,plain,
add(X1,multiply(inverse(X1),X2)) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_19]) ).
cnf(c_0_28,hypothesis,
add(a,multiply(b,X1)) = add(a,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_24]),c_0_19]) ).
cnf(c_0_29,plain,
add(additive_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_30,plain,
multiply(X1,add(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
add(X1,inverse(inverse(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_15]),c_0_16]) ).
cnf(c_0_32,hypothesis,
multiply(a,b) = additive_identity,
b_an_additive_identity ).
cnf(c_0_33,hypothesis,
add(a,inverse(b)) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_15]),c_0_16]) ).
cnf(c_0_34,plain,
multiply(X1,add(inverse(X1),X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_29]) ).
cnf(c_0_35,plain,
multiply(X1,inverse(inverse(X1))) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_17]) ).
cnf(c_0_36,hypothesis,
multiply(a,add(b,X1)) = multiply(a,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_29]) ).
cnf(c_0_37,hypothesis,
multiply(a,inverse(b)) = inverse(b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_33]),c_0_17]) ).
cnf(c_0_38,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_12]),c_0_13]),c_0_35]) ).
cnf(c_0_39,hypothesis,
inverse(b) = a,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_12]),c_0_13]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
b != inverse(a),
prove_a_inverse_is_b ).
cnf(c_0_41,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : BOO013-4 : TPTP v8.1.2. Released v1.1.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n026.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 20:47:14 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.39 Running first-order theorem proving
% 0.15/0.39 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.hyV4hUQQ7c/E---3.1_24728.p
% 0.15/0.40 # Version: 3.1pre001
% 0.15/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.40 # Starting sh5l with 300s (1) cores
% 0.15/0.40 # sh5l with pid 24809 completed with status 0
% 0.15/0.40 # Result found by sh5l
% 0.15/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.40 # Starting sh5l with 300s (1) cores
% 0.15/0.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.40 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.15/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.40 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.40 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 24816 completed with status 0
% 0.15/0.40 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.40 # Starting sh5l with 300s (1) cores
% 0.15/0.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.40 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.15/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.40 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.40 # Preprocessing time : 0.001 s
% 0.15/0.40 # Presaturation interreduction done
% 0.15/0.40
% 0.15/0.40 # Proof found!
% 0.15/0.40 # SZS status Unsatisfiable
% 0.15/0.40 # SZS output start CNFRefutation
% See solution above
% 0.15/0.40 # Parsed axioms : 11
% 0.15/0.40 # Removed by relevancy pruning/SinE : 0
% 0.15/0.40 # Initial clauses : 11
% 0.15/0.40 # Removed in clause preprocessing : 0
% 0.15/0.40 # Initial clauses in saturation : 11
% 0.15/0.40 # Processed clauses : 114
% 0.15/0.40 # ...of these trivial : 36
% 0.15/0.40 # ...subsumed : 5
% 0.15/0.40 # ...remaining for further processing : 73
% 0.15/0.40 # Other redundant clauses eliminated : 0
% 0.15/0.40 # Clauses deleted for lack of memory : 0
% 0.15/0.40 # Backward-subsumed : 0
% 0.15/0.40 # Backward-rewritten : 14
% 0.15/0.40 # Generated clauses : 718
% 0.15/0.40 # ...of the previous two non-redundant : 326
% 0.15/0.40 # ...aggressively subsumed : 0
% 0.15/0.40 # Contextual simplify-reflections : 0
% 0.15/0.40 # Paramodulations : 718
% 0.15/0.40 # Factorizations : 0
% 0.15/0.40 # NegExts : 0
% 0.15/0.40 # Equation resolutions : 0
% 0.15/0.40 # Total rewrite steps : 814
% 0.15/0.40 # Propositional unsat checks : 0
% 0.15/0.40 # Propositional check models : 0
% 0.15/0.40 # Propositional check unsatisfiable : 0
% 0.15/0.40 # Propositional clauses : 0
% 0.15/0.40 # Propositional clauses after purity: 0
% 0.15/0.40 # Propositional unsat core size : 0
% 0.15/0.40 # Propositional preprocessing time : 0.000
% 0.15/0.40 # Propositional encoding time : 0.000
% 0.15/0.40 # Propositional solver time : 0.000
% 0.15/0.40 # Success case prop preproc time : 0.000
% 0.15/0.40 # Success case prop encoding time : 0.000
% 0.15/0.40 # Success case prop solver time : 0.000
% 0.15/0.40 # Current number of processed clauses : 48
% 0.15/0.40 # Positive orientable unit clauses : 45
% 0.15/0.40 # Positive unorientable unit clauses: 2
% 0.15/0.40 # Negative unit clauses : 1
% 0.15/0.40 # Non-unit-clauses : 0
% 0.15/0.40 # Current number of unprocessed clauses: 221
% 0.15/0.40 # ...number of literals in the above : 221
% 0.15/0.40 # Current number of archived formulas : 0
% 0.15/0.40 # Current number of archived clauses : 25
% 0.15/0.40 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.40 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.40 # Non-unit clause-clause subsumptions : 0
% 0.15/0.40 # Unit Clause-clause subsumption calls : 1
% 0.15/0.40 # Rewrite failures with RHS unbound : 0
% 0.15/0.40 # BW rewrite match attempts : 129
% 0.15/0.40 # BW rewrite match successes : 42
% 0.15/0.40 # Condensation attempts : 0
% 0.15/0.40 # Condensation successes : 0
% 0.15/0.40 # Termbank termtop insertions : 4749
% 0.15/0.40
% 0.15/0.40 # -------------------------------------------------
% 0.15/0.40 # User time : 0.008 s
% 0.15/0.40 # System time : 0.000 s
% 0.15/0.40 # Total time : 0.008 s
% 0.15/0.40 # Maximum resident set size: 1428 pages
% 0.15/0.40
% 0.15/0.40 # -------------------------------------------------
% 0.15/0.40 # User time : 0.008 s
% 0.15/0.40 # System time : 0.002 s
% 0.15/0.40 # Total time : 0.010 s
% 0.15/0.40 # Maximum resident set size: 1672 pages
% 0.15/0.40 % E---3.1 exiting
% 0.15/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------