TSTP Solution File: BOO025-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : BOO025-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : Sat May 4 07:26:47 EDT 2024
% Result : Unsatisfiable 0.48s 0.53s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of clauses : 57 ( 57 unt; 0 nHn; 7 RR)
% Number of literals : 57 ( 56 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 87 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(pixley1,axiom,
pixley(X1,X1,X2) = X2,
file('/export/starexec/sandbox2/tmp/tmp.gDk3tycDEe/E---3.1_4130.p',pixley1) ).
cnf(pixley_defn,axiom,
pixley(X1,X2,X3) = add(multiply(X1,inverse(X2)),add(multiply(X1,X3),multiply(inverse(X2),X3))),
file('/export/starexec/sandbox2/tmp/tmp.gDk3tycDEe/E---3.1_4130.p',pixley_defn) ).
cnf(multiply_add_property,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X2,X1),multiply(X3,X1)),
file('/export/starexec/sandbox2/tmp/tmp.gDk3tycDEe/E---3.1_4130.p',multiply_add_property) ).
cnf(additive_inverse,axiom,
add(X1,inverse(X1)) = n1,
file('/export/starexec/sandbox2/tmp/tmp.gDk3tycDEe/E---3.1_4130.p',additive_inverse) ).
cnf(multiply_add,axiom,
multiply(add(X1,X2),X2) = X2,
file('/export/starexec/sandbox2/tmp/tmp.gDk3tycDEe/E---3.1_4130.p',multiply_add) ).
cnf(pixley3,axiom,
pixley(X1,X2,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.gDk3tycDEe/E---3.1_4130.p',pixley3) ).
cnf(pixley2,axiom,
pixley(X1,X2,X2) = X1,
file('/export/starexec/sandbox2/tmp/tmp.gDk3tycDEe/E---3.1_4130.p',pixley2) ).
cnf(prove_equal_identity,negated_conjecture,
multiply(b,inverse(b)) != multiply(a,inverse(a)),
file('/export/starexec/sandbox2/tmp/tmp.gDk3tycDEe/E---3.1_4130.p',prove_equal_identity) ).
cnf(c_0_8,axiom,
pixley(X1,X1,X2) = X2,
pixley1 ).
cnf(c_0_9,axiom,
pixley(X1,X2,X3) = add(multiply(X1,inverse(X2)),add(multiply(X1,X3),multiply(inverse(X2),X3))),
pixley_defn ).
cnf(c_0_10,plain,
add(multiply(X1,inverse(X1)),add(multiply(X1,X2),multiply(inverse(X1),X2))) = X2,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X2,X1),multiply(X3,X1)),
multiply_add_property ).
cnf(c_0_12,axiom,
add(X1,inverse(X1)) = n1,
additive_inverse ).
cnf(c_0_13,axiom,
multiply(add(X1,X2),X2) = X2,
multiply_add ).
cnf(c_0_14,plain,
add(multiply(X1,inverse(X1)),multiply(X2,n1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,plain,
multiply(n1,inverse(X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_16,plain,
multiply(X1,multiply(X1,n1)) = multiply(X1,n1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
add(inverse(n1),multiply(X1,n1)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
add(multiply(X1,n1),multiply(X2,multiply(X1,n1))) = multiply(multiply(X1,n1),add(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_19,plain,
multiply(multiply(X1,add(X2,X3)),multiply(X3,X1)) = multiply(X3,X1),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_20,plain,
multiply(X1,add(X2,add(X3,X1))) = add(multiply(X2,X1),X1),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_21,plain,
add(inverse(n1),n1) = add(X1,n1),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_22,plain,
multiply(multiply(X1,n1),add(X1,X1)) = multiply(n1,add(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_11]) ).
cnf(c_0_23,plain,
multiply(add(X1,X2),add(multiply(X3,X2),X2)) = add(multiply(X3,X2),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_20]),c_0_20]) ).
cnf(c_0_24,plain,
add(X1,n1) = add(X2,n1),
inference(spm,[status(thm)],[c_0_21,c_0_21]) ).
cnf(c_0_25,plain,
multiply(add(X1,X1),add(X2,multiply(X1,n1))) = multiply(add(X1,X1),add(X2,n1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_22]),c_0_11]) ).
cnf(c_0_26,plain,
multiply(add(X1,n1),add(X2,n1)) = add(X2,n1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
multiply(add(X1,X1),add(inverse(n1),n1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_13]) ).
cnf(c_0_28,plain,
add(inverse(n1),n1) = n1,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
multiply(add(X1,X1),n1) = X1,
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,axiom,
pixley(X1,X2,X1) = X1,
pixley3 ).
cnf(c_0_31,plain,
add(inverse(n1),X1) = add(X1,X1),
inference(spm,[status(thm)],[c_0_17,c_0_29]) ).
cnf(c_0_32,plain,
multiply(X1,add(add(X2,X1),X3)) = add(X1,multiply(X3,X1)),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_33,plain,
add(multiply(X1,inverse(X2)),add(multiply(X1,X1),multiply(inverse(X2),X1))) = X1,
inference(rw,[status(thm)],[c_0_30,c_0_9]) ).
cnf(c_0_34,plain,
multiply(add(inverse(n1),X1),n1) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_31]) ).
cnf(c_0_35,plain,
multiply(n1,n1) = n1,
inference(spm,[status(thm)],[c_0_13,c_0_28]) ).
cnf(c_0_36,plain,
multiply(X1,add(X2,n1)) = add(X1,multiply(n1,X1)),
inference(spm,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_37,plain,
add(X1,n1) = n1,
inference(spm,[status(thm)],[c_0_24,c_0_28]) ).
cnf(c_0_38,plain,
add(multiply(X1,inverse(X2)),multiply(X1,add(X1,inverse(X2)))) = X1,
inference(rw,[status(thm)],[c_0_33,c_0_11]) ).
cnf(c_0_39,plain,
inverse(inverse(n1)) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_12]),c_0_35]) ).
cnf(c_0_40,plain,
multiply(add(X1,X2),add(X2,X2)) = add(X2,X2),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_41,plain,
add(X1,multiply(n1,X1)) = multiply(X1,n1),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
multiply(n1,add(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_37]),c_0_11]) ).
cnf(c_0_43,plain,
multiply(X1,multiply(n1,add(X1,X1))) = multiply(n1,add(X1,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_17]),c_0_11]),c_0_11]) ).
cnf(c_0_44,axiom,
pixley(X1,X2,X2) = X1,
pixley2 ).
cnf(c_0_45,plain,
add(add(X1,X1),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_29]) ).
cnf(c_0_46,plain,
multiply(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_42]),c_0_42]) ).
cnf(c_0_47,plain,
add(multiply(X1,inverse(X2)),add(multiply(X1,X2),multiply(inverse(X2),X2))) = X1,
inference(rw,[status(thm)],[c_0_44,c_0_9]) ).
cnf(c_0_48,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_45]),c_0_46]),c_0_46]) ).
cnf(c_0_49,plain,
add(multiply(X1,inverse(X2)),multiply(X2,add(X1,inverse(X2)))) = X1,
inference(rw,[status(thm)],[c_0_47,c_0_11]) ).
cnf(c_0_50,plain,
add(inverse(n1),X1) = X1,
inference(rw,[status(thm)],[c_0_31,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
multiply(b,inverse(b)) != multiply(a,inverse(a)),
inference(fof_simplification,[status(thm)],[prove_equal_identity]) ).
cnf(c_0_52,plain,
multiply(inverse(X1),X1) = inverse(n1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_11]),c_0_50]) ).
cnf(c_0_53,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_48]),c_0_48]) ).
cnf(c_0_54,negated_conjecture,
multiply(b,inverse(b)) != multiply(a,inverse(a)),
c_0_51 ).
cnf(c_0_55,plain,
multiply(X1,inverse(X1)) = inverse(n1),
inference(rw,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : BOO025-1 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n002.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 12:10:42 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.gDk3tycDEe/E---3.1_4130.p
% 0.48/0.53 # Version: 3.1.0
% 0.48/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.48/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.48/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.48/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.48/0.53 # Starting sh5l with 300s (1) cores
% 0.48/0.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4284 completed with status 0
% 0.48/0.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.48/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.48/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.48/0.53 # No SInE strategy applied
% 0.48/0.53 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.48/0.53 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.48/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.48/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.48/0.53 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.48/0.53 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.48/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.48/0.53 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 4290 completed with status 0
% 0.48/0.53 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.48/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.48/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.48/0.53 # No SInE strategy applied
% 0.48/0.53 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.48/0.53 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.48/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 0.48/0.53 # Preprocessing time : 0.001 s
% 0.48/0.53 # Presaturation interreduction done
% 0.48/0.53
% 0.48/0.53 # Proof found!
% 0.48/0.53 # SZS status Unsatisfiable
% 0.48/0.53 # SZS output start CNFRefutation
% See solution above
% 0.48/0.53 # Parsed axioms : 8
% 0.48/0.53 # Removed by relevancy pruning/SinE : 0
% 0.48/0.53 # Initial clauses : 8
% 0.48/0.53 # Removed in clause preprocessing : 1
% 0.48/0.53 # Initial clauses in saturation : 7
% 0.48/0.53 # Processed clauses : 141
% 0.48/0.53 # ...of these trivial : 38
% 0.48/0.53 # ...subsumed : 14
% 0.48/0.53 # ...remaining for further processing : 89
% 0.48/0.53 # Other redundant clauses eliminated : 0
% 0.48/0.53 # Clauses deleted for lack of memory : 0
% 0.48/0.53 # Backward-subsumed : 2
% 0.48/0.53 # Backward-rewritten : 57
% 0.48/0.53 # Generated clauses : 1706
% 0.48/0.53 # ...of the previous two non-redundant : 1228
% 0.48/0.53 # ...aggressively subsumed : 0
% 0.48/0.53 # Contextual simplify-reflections : 0
% 0.48/0.53 # Paramodulations : 1706
% 0.48/0.53 # Factorizations : 0
% 0.48/0.53 # NegExts : 0
% 0.48/0.53 # Equation resolutions : 0
% 0.48/0.53 # Disequality decompositions : 0
% 0.48/0.53 # Total rewrite steps : 1872
% 0.48/0.53 # ...of those cached : 1404
% 0.48/0.53 # Propositional unsat checks : 0
% 0.48/0.53 # Propositional check models : 0
% 0.48/0.53 # Propositional check unsatisfiable : 0
% 0.48/0.53 # Propositional clauses : 0
% 0.48/0.53 # Propositional clauses after purity: 0
% 0.48/0.53 # Propositional unsat core size : 0
% 0.48/0.53 # Propositional preprocessing time : 0.000
% 0.48/0.53 # Propositional encoding time : 0.000
% 0.48/0.53 # Propositional solver time : 0.000
% 0.48/0.53 # Success case prop preproc time : 0.000
% 0.48/0.53 # Success case prop encoding time : 0.000
% 0.48/0.53 # Success case prop solver time : 0.000
% 0.48/0.53 # Current number of processed clauses : 23
% 0.48/0.53 # Positive orientable unit clauses : 22
% 0.48/0.53 # Positive unorientable unit clauses: 1
% 0.48/0.53 # Negative unit clauses : 0
% 0.48/0.53 # Non-unit-clauses : 0
% 0.48/0.53 # Current number of unprocessed clauses: 1081
% 0.48/0.53 # ...number of literals in the above : 1081
% 0.48/0.53 # Current number of archived formulas : 0
% 0.48/0.53 # Current number of archived clauses : 67
% 0.48/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.48/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.48/0.53 # Non-unit clause-clause subsumptions : 0
% 0.48/0.53 # Unit Clause-clause subsumption calls : 21
% 0.48/0.53 # Rewrite failures with RHS unbound : 39
% 0.48/0.53 # BW rewrite match attempts : 285
% 0.48/0.53 # BW rewrite match successes : 106
% 0.48/0.53 # Condensation attempts : 0
% 0.48/0.53 # Condensation successes : 0
% 0.48/0.53 # Termbank termtop insertions : 23340
% 0.48/0.53 # Search garbage collected termcells : 2
% 0.48/0.53
% 0.48/0.53 # -------------------------------------------------
% 0.48/0.53 # User time : 0.024 s
% 0.48/0.53 # System time : 0.001 s
% 0.48/0.53 # Total time : 0.025 s
% 0.48/0.53 # Maximum resident set size: 1628 pages
% 0.48/0.53
% 0.48/0.53 # -------------------------------------------------
% 0.48/0.53 # User time : 0.096 s
% 0.48/0.53 # System time : 0.013 s
% 0.48/0.53 # Total time : 0.109 s
% 0.48/0.53 # Maximum resident set size: 1684 pages
% 0.48/0.53 % E---3.1 exiting
% 0.48/0.53 % E exiting
%------------------------------------------------------------------------------