TSTP Solution File: GRP012-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP012-3 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 May 20 20:43:37 EDT 2024
% Result : Unsatisfiable 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of clauses : 38 ( 24 unt; 0 nHn; 18 RR)
% Number of literals : 63 ( 17 equ; 28 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 83 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity2,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',associativity2) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',left_inverse) ).
cnf(total_function2,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',total_function2) ).
cnf(total_function1,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',total_function1) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',left_identity) ).
cnf(right_identity,axiom,
product(X1,identity,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',right_identity) ).
cnf(prove_inverse_of_product_is_product_of_inverses,negated_conjecture,
inverse(multiply(a,b)) != multiply(inverse(b),inverse(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_inverse_of_product_is_product_of_inverses) ).
cnf(c_0_7,plain,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity2]) ).
cnf(c_0_8,plain,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
c_0_7 ).
cnf(c_0_9,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_10,plain,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[total_function2]) ).
cnf(c_0_11,plain,
( product(identity,X1,X2)
| ~ product(inverse(X3),X4,X2)
| ~ product(X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
product(X1,X2,multiply(X1,X2)),
total_function1 ).
cnf(c_0_13,plain,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
c_0_10 ).
cnf(c_0_14,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_15,plain,
( product(identity,X1,multiply(inverse(X2),X3))
| ~ product(X2,X1,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( X1 = X2
| ~ product(identity,X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( multiply(X1,X2) = X3
| ~ product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_18,plain,
product(identity,X1,multiply(inverse(X2),multiply(X2,X1))),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_19,plain,
multiply(identity,X1) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_20,axiom,
product(X1,identity,X1),
right_identity ).
cnf(c_0_21,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,plain,
( X1 = X2
| ~ product(X1,identity,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_23,plain,
( product(X1,X2,X3)
| ~ product(X4,X2,identity)
| ~ product(X3,X4,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_20]) ).
cnf(c_0_24,plain,
product(inverse(X1),multiply(X1,X2),X2),
inference(spm,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_25,plain,
multiply(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_26,plain,
( product(X1,X2,X3)
| ~ product(X3,inverse(X2),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_27,plain,
( product(identity,X1,inverse(X2))
| ~ product(X2,X1,identity) ),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_28,plain,
product(multiply(X1,inverse(X2)),X2,X1),
inference(spm,[status(thm)],[c_0_26,c_0_12]) ).
cnf(c_0_29,plain,
product(identity,X1,inverse(inverse(X1))),
inference(spm,[status(thm)],[c_0_27,c_0_9]) ).
cnf(c_0_30,plain,
multiply(multiply(X1,inverse(X2)),X2) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_31,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_29]),c_0_19]) ).
cnf(c_0_32,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
inverse(multiply(a,b)) != multiply(inverse(b),inverse(a)),
inference(fof_simplification,[status(thm)],[prove_inverse_of_product_is_product_of_inverses]) ).
cnf(c_0_34,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(spm,[status(thm)],[c_0_21,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
inverse(multiply(a,b)) != multiply(inverse(b),inverse(a)),
c_0_33 ).
cnf(c_0_36,plain,
multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP012-3 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 05:27:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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/benchmark/theBenchmark.p
% 0.19/0.48 # Version: 3.1.0
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # new_bool_3 with pid 7079 completed with status 0
% 0.19/0.48 # Result found by new_bool_3
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FHUSM-FFSF21-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.19/0.48 # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 7084 completed with status 0
% 0.19/0.48 # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FHUSM-FFSF21-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Unsatisfiable
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 9
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 9
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 9
% 0.19/0.48 # Processed clauses : 144
% 0.19/0.48 # ...of these trivial : 2
% 0.19/0.48 # ...subsumed : 64
% 0.19/0.48 # ...remaining for further processing : 78
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 3
% 0.19/0.48 # Backward-rewritten : 5
% 0.19/0.48 # Generated clauses : 663
% 0.19/0.48 # ...of the previous two non-redundant : 360
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 663
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 482
% 0.19/0.48 # ...of those cached : 427
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 70
% 0.19/0.48 # Positive orientable unit clauses : 22
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 0
% 0.19/0.48 # Non-unit-clauses : 48
% 0.19/0.48 # Current number of unprocessed clauses: 215
% 0.19/0.48 # ...number of literals in the above : 455
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 8
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 984
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 965
% 0.19/0.48 # Non-unit clause-clause subsumptions : 67
% 0.19/0.48 # Unit Clause-clause subsumption calls : 3
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 22
% 0.19/0.48 # BW rewrite match successes : 4
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 5761
% 0.19/0.48 # Search garbage collected termcells : 18
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.011 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.012 s
% 0.19/0.48 # Maximum resident set size: 1632 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.012 s
% 0.19/0.48 # System time : 0.004 s
% 0.19/0.48 # Total time : 0.016 s
% 0.19/0.48 # Maximum resident set size: 1704 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------