TSTP Solution File: GRP114-1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : GRP114-1 : TPTP v8.2.0. Released v1.2.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 : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 06:42:54 EDT 2024
% Result : Unsatisfiable 0.73s 0.56s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 63 ( 63 unt; 0 nHn; 6 RR)
% Number of literals : 63 ( 62 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 : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 98 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(inverse_product_lemma,axiom,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',inverse_product_lemma) ).
cnf(inverse_of_identity,axiom,
inverse(identity) = identity,
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',inverse_of_identity) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',left_identity) ).
cnf(inverse_involution,axiom,
inverse(inverse(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',inverse_involution) ).
cnf(union_intersection_absorbtion,axiom,
union(intersection(X1,X2),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',union_intersection_absorbtion) ).
cnf(union_commutative,axiom,
union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',union_commutative) ).
cnf(negative_part,axiom,
negative_part(X1) = intersection(X1,identity),
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',negative_part) ).
cnf(intersection_associative,axiom,
intersection(X1,intersection(X2,X3)) = intersection(intersection(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',intersection_associative) ).
cnf(multiply_intersection2,axiom,
multiply(intersection(X1,X2),X3) = intersection(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',multiply_intersection2) ).
cnf(intersection_commutative,axiom,
intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',intersection_commutative) ).
cnf(multiply_union1,axiom,
multiply(X1,union(X2,X3)) = union(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',multiply_union1) ).
cnf(positive_part,axiom,
positive_part(X1) = union(X1,identity),
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',positive_part) ).
cnf(intersection_union_absorbtion,axiom,
intersection(union(X1,X2),X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',intersection_union_absorbtion) ).
cnf(union_associative,axiom,
union(X1,union(X2,X3)) = union(union(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',union_associative) ).
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',left_inverse) ).
cnf(prove_product,negated_conjecture,
multiply(positive_part(a),negative_part(a)) != a,
file('/export/starexec/sandbox/tmp/tmp.lIt7wbFOQQ/E---3.1_18972.p',prove_product) ).
cnf(c_0_17,axiom,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
inverse_product_lemma ).
cnf(c_0_18,axiom,
inverse(identity) = identity,
inverse_of_identity ).
cnf(c_0_19,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_20,plain,
multiply(inverse(X1),identity) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_21,axiom,
inverse(inverse(X1)) = X1,
inverse_involution ).
cnf(c_0_22,axiom,
union(intersection(X1,X2),X2) = X2,
union_intersection_absorbtion ).
cnf(c_0_23,axiom,
union(X1,X2) = union(X2,X1),
union_commutative ).
cnf(c_0_24,axiom,
negative_part(X1) = intersection(X1,identity),
negative_part ).
cnf(c_0_25,axiom,
intersection(X1,intersection(X2,X3)) = intersection(intersection(X1,X2),X3),
intersection_associative ).
cnf(c_0_26,axiom,
multiply(intersection(X1,X2),X3) = intersection(multiply(X1,X3),multiply(X2,X3)),
multiply_intersection2 ).
cnf(c_0_27,axiom,
intersection(X1,X2) = intersection(X2,X1),
intersection_commutative ).
cnf(c_0_28,axiom,
multiply(X1,union(X2,X3)) = union(multiply(X1,X2),multiply(X1,X3)),
multiply_union1 ).
cnf(c_0_29,plain,
multiply(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,axiom,
positive_part(X1) = union(X1,identity),
positive_part ).
cnf(c_0_31,axiom,
intersection(union(X1,X2),X2) = X2,
intersection_union_absorbtion ).
cnf(c_0_32,axiom,
union(X1,union(X2,X3)) = union(union(X1,X2),X3),
union_associative ).
cnf(c_0_33,plain,
union(X1,intersection(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_34,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_35,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_36,plain,
negative_part(intersection(X1,X2)) = intersection(X1,negative_part(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_24]) ).
cnf(c_0_37,plain,
intersection(X1,multiply(X2,X1)) = multiply(negative_part(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_24]),c_0_27]) ).
cnf(c_0_38,plain,
union(X1,multiply(X1,X2)) = multiply(X1,positive_part(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_23]) ).
cnf(c_0_39,plain,
intersection(X1,union(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_40,plain,
intersection(identity,X1) = negative_part(X1),
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_41,plain,
positive_part(union(X1,X2)) = union(X1,positive_part(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_32]),c_0_30]) ).
cnf(c_0_42,plain,
union(identity,negative_part(X1)) = identity,
inference(spm,[status(thm)],[c_0_33,c_0_24]) ).
cnf(c_0_43,plain,
union(identity,X1) = positive_part(X1),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_44,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_19]) ).
cnf(c_0_45,plain,
intersection(X1,negative_part(multiply(X2,X1))) = negative_part(multiply(negative_part(X2),X1)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_46,plain,
multiply(inverse(X1),positive_part(X1)) = positive_part(inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_35]),c_0_30]) ).
cnf(c_0_47,plain,
negative_part(positive_part(X1)) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_30]) ).
cnf(c_0_48,plain,
union(X1,positive_part(multiply(X1,X2))) = positive_part(multiply(X1,positive_part(X2))),
inference(spm,[status(thm)],[c_0_41,c_0_38]) ).
cnf(c_0_49,plain,
multiply(negative_part(inverse(X1)),X1) = negative_part(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_35]),c_0_24]) ).
cnf(c_0_50,plain,
positive_part(negative_part(X1)) = identity,
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_17]),c_0_21]) ).
cnf(c_0_52,plain,
union(X1,negative_part(X1)) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_40]) ).
cnf(c_0_53,plain,
negative_part(multiply(negative_part(inverse(X1)),positive_part(X1))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_24]),c_0_47]) ).
cnf(c_0_54,plain,
positive_part(multiply(negative_part(inverse(X1)),positive_part(X1))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_30]),c_0_50]) ).
cnf(c_0_55,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_51]),c_0_21]) ).
cnf(c_0_56,plain,
multiply(negative_part(inverse(X1)),positive_part(X1)) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_30]),c_0_54]) ).
cnf(c_0_57,negated_conjecture,
multiply(positive_part(a),negative_part(a)) != a,
inference(fof_simplification,[status(thm)],[prove_product]) ).
cnf(c_0_58,plain,
multiply(positive_part(X1),inverse(positive_part(inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_46]),c_0_21]) ).
cnf(c_0_59,plain,
inverse(positive_part(X1)) = negative_part(inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_18]),c_0_19]) ).
cnf(c_0_60,negated_conjecture,
multiply(positive_part(a),negative_part(a)) != a,
c_0_57 ).
cnf(c_0_61,plain,
multiply(positive_part(X1),negative_part(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_21]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP114-1 : TPTP v8.2.0. Released v1.2.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 11:01:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.lIt7wbFOQQ/E---3.1_18972.p
% 0.73/0.56 # Version: 3.2.0
% 0.73/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.73/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.73/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.73/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.73/0.56 # Starting sh5l with 300s (1) cores
% 0.73/0.56 # new_bool_1 with pid 19070 completed with status 0
% 0.73/0.56 # Result found by new_bool_1
% 0.73/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.73/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.73/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.73/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.73/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.73/0.56 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.73/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.73/0.56 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.73/0.56 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 19075 completed with status 0
% 0.73/0.56 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.73/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.73/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.73/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.73/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.73/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.73/0.56 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.73/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.73/0.56 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.73/0.56 # Preprocessing time : 0.001 s
% 0.73/0.56 # Presaturation interreduction done
% 0.73/0.56
% 0.73/0.56 # Proof found!
% 0.73/0.56 # SZS status Unsatisfiable
% 0.73/0.56 # SZS output start CNFRefutation
% See solution above
% 0.73/0.56 # Parsed axioms : 21
% 0.73/0.56 # Removed by relevancy pruning/SinE : 0
% 0.73/0.56 # Initial clauses : 21
% 0.73/0.56 # Removed in clause preprocessing : 0
% 0.73/0.56 # Initial clauses in saturation : 21
% 0.73/0.56 # Processed clauses : 390
% 0.73/0.56 # ...of these trivial : 142
% 0.73/0.56 # ...subsumed : 40
% 0.73/0.56 # ...remaining for further processing : 208
% 0.73/0.56 # Other redundant clauses eliminated : 0
% 0.73/0.56 # Clauses deleted for lack of memory : 0
% 0.73/0.56 # Backward-subsumed : 0
% 0.73/0.56 # Backward-rewritten : 29
% 0.73/0.56 # Generated clauses : 7276
% 0.73/0.56 # ...of the previous two non-redundant : 2942
% 0.73/0.56 # ...aggressively subsumed : 0
% 0.73/0.56 # Contextual simplify-reflections : 0
% 0.73/0.56 # Paramodulations : 7276
% 0.73/0.56 # Factorizations : 0
% 0.73/0.56 # NegExts : 0
% 0.73/0.56 # Equation resolutions : 0
% 0.73/0.56 # Disequality decompositions : 0
% 0.73/0.56 # Total rewrite steps : 12789
% 0.73/0.56 # ...of those cached : 10784
% 0.73/0.56 # Propositional unsat checks : 0
% 0.73/0.56 # Propositional check models : 0
% 0.73/0.56 # Propositional check unsatisfiable : 0
% 0.73/0.56 # Propositional clauses : 0
% 0.73/0.56 # Propositional clauses after purity: 0
% 0.73/0.56 # Propositional unsat core size : 0
% 0.73/0.56 # Propositional preprocessing time : 0.000
% 0.73/0.56 # Propositional encoding time : 0.000
% 0.73/0.56 # Propositional solver time : 0.000
% 0.73/0.56 # Success case prop preproc time : 0.000
% 0.73/0.56 # Success case prop encoding time : 0.000
% 0.73/0.56 # Success case prop solver time : 0.000
% 0.73/0.56 # Current number of processed clauses : 158
% 0.73/0.56 # Positive orientable unit clauses : 154
% 0.73/0.56 # Positive unorientable unit clauses: 4
% 0.73/0.56 # Negative unit clauses : 0
% 0.73/0.56 # Non-unit-clauses : 0
% 0.73/0.56 # Current number of unprocessed clauses: 2592
% 0.73/0.56 # ...number of literals in the above : 2592
% 0.73/0.56 # Current number of archived formulas : 0
% 0.73/0.56 # Current number of archived clauses : 50
% 0.73/0.56 # Clause-clause subsumption calls (NU) : 0
% 0.73/0.56 # Rec. Clause-clause subsumption calls : 0
% 0.73/0.56 # Non-unit clause-clause subsumptions : 0
% 0.73/0.56 # Unit Clause-clause subsumption calls : 7
% 0.73/0.56 # Rewrite failures with RHS unbound : 0
% 0.73/0.56 # BW rewrite match attempts : 161
% 0.73/0.56 # BW rewrite match successes : 88
% 0.73/0.56 # Condensation attempts : 0
% 0.73/0.56 # Condensation successes : 0
% 0.73/0.56 # Termbank termtop insertions : 56317
% 0.73/0.56 # Search garbage collected termcells : 2
% 0.73/0.56
% 0.73/0.56 # -------------------------------------------------
% 0.73/0.56 # User time : 0.052 s
% 0.73/0.56 # System time : 0.005 s
% 0.73/0.56 # Total time : 0.057 s
% 0.73/0.57 # Maximum resident set size: 1632 pages
% 0.73/0.57
% 0.73/0.57 # -------------------------------------------------
% 0.73/0.57 # User time : 0.053 s
% 0.73/0.57 # System time : 0.008 s
% 0.73/0.57 # Total time : 0.061 s
% 0.73/0.57 # Maximum resident set size: 1692 pages
% 0.73/0.57 % E---3.1 exiting
% 0.73/0.57 % E exiting
%------------------------------------------------------------------------------