TSTP Solution File: GRP578-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP578-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:58:02 EDT 2024
% Result : Unsatisfiable 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 6 RR)
% Number of literals : 39 ( 38 equ; 3 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(X1,double_divide(double_divide(double_divide(X2,X1),X3),double_divide(X2,identity))),double_divide(identity,identity)) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_0_5,axiom,
double_divide(double_divide(X1,double_divide(double_divide(double_divide(X2,X1),X3),double_divide(X2,identity))),double_divide(identity,identity)) = X3,
single_axiom ).
cnf(c_0_6,axiom,
inverse(X1) = double_divide(X1,identity),
inverse ).
cnf(c_0_7,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_8,plain,
double_divide(double_divide(X1,double_divide(double_divide(double_divide(X2,X1),X3),inverse(X2))),inverse(identity)) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_9,axiom,
identity = double_divide(X1,inverse(X1)),
identity ).
cnf(c_0_10,plain,
inverse(double_divide(X1,X2)) = multiply(X2,X1),
inference(rw,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_11,plain,
double_divide(double_divide(X1,double_divide(identity,inverse(X2))),inverse(identity)) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_12,plain,
double_divide(inverse(X1),inverse(identity)) = multiply(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_9]),c_0_6]) ).
cnf(c_0_13,plain,
multiply(inverse(identity),inverse(X1)) = inverse(multiply(X1,identity)),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_14,plain,
inverse(inverse(X1)) = multiply(identity,X1),
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_15,plain,
inverse(multiply(inverse(X1),identity)) = multiply(inverse(identity),multiply(identity,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
multiply(inverse(X1),X1) = inverse(identity),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_17,plain,
double_divide(double_divide(X1,double_divide(multiply(X1,X2),inverse(X2))),inverse(identity)) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_6]),c_0_10]) ).
cnf(c_0_18,plain,
multiply(inverse(identity),multiply(identity,identity)) = multiply(identity,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14]) ).
cnf(c_0_19,plain,
double_divide(multiply(identity,X1),inverse(identity)) = multiply(inverse(X1),identity),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_20,plain,
inverse(identity) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_9]),c_0_6]),c_0_14]),c_0_19]),c_0_16]) ).
cnf(c_0_21,plain,
multiply(double_divide(identity,inverse(X1)),X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_20]),c_0_6]),c_0_10]) ).
cnf(c_0_22,plain,
multiply(double_divide(identity,multiply(X1,X2)),X3) = multiply(X3,double_divide(X2,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_10]) ).
cnf(c_0_23,plain,
multiply(identity,X1) = multiply(X1,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_20]),c_0_6]),c_0_14]) ).
cnf(c_0_24,plain,
multiply(X1,double_divide(identity,X2)) = multiply(X1,inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_22]),c_0_6]) ).
cnf(c_0_25,plain,
multiply(double_divide(identity,X1),X2) = multiply(inverse(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_24]),c_0_21]) ).
cnf(c_0_26,plain,
multiply(identity,double_divide(X1,X2)) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_27,plain,
multiply(identity,inverse(X1)) = inverse(multiply(identity,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_28,plain,
multiply(multiply(identity,X1),X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_25]),c_0_14]) ).
cnf(c_0_29,plain,
multiply(identity,multiply(identity,X1)) = multiply(identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_26]),c_0_23]),c_0_27]),c_0_14]) ).
cnf(c_0_30,plain,
multiply(X1,multiply(identity,X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_28]) ).
cnf(c_0_31,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_30]),c_0_28]),c_0_28]) ).
cnf(c_0_32,plain,
multiply(X1,double_divide(double_divide(double_divide(X2,X1),X3),inverse(X2))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_20]),c_0_6]),c_0_10]),c_0_31]) ).
cnf(c_0_33,negated_conjecture,
multiply(identity,a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_34,plain,
multiply(X1,multiply(X2,inverse(X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_20]),c_0_6]),c_0_10]),c_0_24]) ).
cnf(c_0_35,plain,
multiply(X1,multiply(X2,identity)) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
multiply(identity,a2) != a2,
c_0_33 ).
cnf(c_0_37,plain,
multiply(identity,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_20]),c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : GRP578-1 : TPTP v8.2.0. Released v2.6.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 05:18:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.51 Running first-order model finding
% 0.22/0.51 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.22/0.53 # Version: 3.1.0
% 0.22/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # sh5l with pid 10321 completed with status 0
% 0.22/0.53 # Result found by sh5l
% 0.22/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.53 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.22/0.53 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.22/0.53 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 10327 completed with status 0
% 0.22/0.53 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 0.22/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.53 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.22/0.53 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Unsatisfiable
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 5
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 5
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 5
% 0.22/0.53 # Processed clauses : 116
% 0.22/0.53 # ...of these trivial : 36
% 0.22/0.53 # ...subsumed : 18
% 0.22/0.53 # ...remaining for further processing : 62
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 1
% 0.22/0.53 # Backward-rewritten : 38
% 0.22/0.53 # Generated clauses : 670
% 0.22/0.53 # ...of the previous two non-redundant : 389
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 670
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 0
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 1033
% 0.22/0.53 # ...of those cached : 814
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 18
% 0.22/0.53 # Positive orientable unit clauses : 17
% 0.22/0.53 # Positive unorientable unit clauses: 1
% 0.22/0.53 # Negative unit clauses : 0
% 0.22/0.53 # Non-unit-clauses : 0
% 0.22/0.53 # Current number of unprocessed clauses: 191
% 0.22/0.53 # ...number of literals in the above : 191
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 44
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.53 # Non-unit clause-clause subsumptions : 0
% 0.22/0.53 # Unit Clause-clause subsumption calls : 12
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 79
% 0.22/0.53 # BW rewrite match successes : 71
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 6374
% 0.22/0.53 # Search garbage collected termcells : 2
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.009 s
% 0.22/0.53 # System time : 0.002 s
% 0.22/0.53 # Total time : 0.011 s
% 0.22/0.53 # Maximum resident set size: 1620 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.010 s
% 0.22/0.53 # System time : 0.004 s
% 0.22/0.53 # Total time : 0.014 s
% 0.22/0.53 # Maximum resident set size: 1684 pages
% 0.22/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------