TSTP Solution File: GRP446-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP446-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:52:18 EDT 2024
% Result : Unsatisfiable 0.13s 0.41s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 5 RR)
% Number of literals : 23 ( 22 equ; 4 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 : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(inverse,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
file('/export/starexec/sandbox/tmp/tmp.zW2N5HXWMI/E---3.1_27252.p',inverse) ).
cnf(single_axiom,axiom,
divide(X1,divide(divide(divide(divide(X1,X1),X2),X3),divide(divide(divide(X1,X1),X1),X3))) = X2,
file('/export/starexec/sandbox/tmp/tmp.zW2N5HXWMI/E---3.1_27252.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/tmp/tmp.zW2N5HXWMI/E---3.1_27252.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
file('/export/starexec/sandbox/tmp/tmp.zW2N5HXWMI/E---3.1_27252.p',multiply) ).
cnf(c_0_4,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
inverse ).
cnf(c_0_5,plain,
divide(inverse(divide(X1,X1)),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_6,axiom,
divide(X1,divide(divide(divide(divide(X1,X1),X2),X3),divide(divide(divide(X1,X1),X1),X3))) = X2,
single_axiom ).
cnf(c_0_7,plain,
divide(inverse(inverse(divide(X1,X1))),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,plain,
divide(X1,divide(divide(inverse(X2),X3),divide(inverse(X1),X3))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_4]),c_0_4]) ).
cnf(c_0_9,plain,
divide(inverse(inverse(inverse(divide(X1,X1)))),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_10,plain,
inverse(divide(divide(inverse(X1),X2),inverse(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_11,plain,
inverse(divide(inverse(X1),inverse(X1))) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_12,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_13,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
multiply ).
cnf(c_0_14,plain,
divide(X1,X1) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_15,plain,
divide(X1,inverse(divide(inverse(X1),inverse(X2)))) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_4]) ).
cnf(c_0_16,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
c_0_12 ).
cnf(c_0_17,plain,
multiply(X1,X2) = divide(X1,inverse(X2)),
inference(rw,[status(thm)],[c_0_13,c_0_4]) ).
cnf(c_0_18,plain,
inverse(divide(b2,b2)) = divide(X1,X1),
inference(rw,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_19,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
inverse(inverse(a2)) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),c_0_4]) ).
cnf(c_0_21,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_18]),c_0_19]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : GRP446-1 : TPTP v8.1.2. Released v2.6.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n003.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Fri May 3 16:15:52 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.zW2N5HXWMI/E---3.1_27252.p
% 0.13/0.41 # Version: 3.1.0
% 0.13/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.41 # Starting sh5l with 300s (1) cores
% 0.13/0.41 # sh5l with pid 27347 completed with status 0
% 0.13/0.41 # Result found by sh5l
% 0.13/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.41 # Starting sh5l with 300s (1) cores
% 0.13/0.41 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.41 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.13/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.41 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.13/0.41 # U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 27353 completed with status 0
% 0.13/0.41 # Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.41 # Starting sh5l with 300s (1) cores
% 0.13/0.41 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.41 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.13/0.41 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.41 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.13/0.41 # Preprocessing time : 0.001 s
% 0.13/0.41 # Presaturation interreduction done
% 0.13/0.41
% 0.13/0.41 # Proof found!
% 0.13/0.41 # SZS status Unsatisfiable
% 0.13/0.41 # SZS output start CNFRefutation
% See solution above
% 0.13/0.41 # Parsed axioms : 4
% 0.13/0.41 # Removed by relevancy pruning/SinE : 0
% 0.13/0.41 # Initial clauses : 4
% 0.13/0.41 # Removed in clause preprocessing : 0
% 0.13/0.41 # Initial clauses in saturation : 4
% 0.13/0.41 # Processed clauses : 43
% 0.13/0.41 # ...of these trivial : 17
% 0.13/0.41 # ...subsumed : 4
% 0.13/0.41 # ...remaining for further processing : 22
% 0.13/0.41 # Other redundant clauses eliminated : 0
% 0.13/0.41 # Clauses deleted for lack of memory : 0
% 0.13/0.41 # Backward-subsumed : 0
% 0.13/0.41 # Backward-rewritten : 8
% 0.13/0.41 # Generated clauses : 212
% 0.13/0.41 # ...of the previous two non-redundant : 155
% 0.13/0.41 # ...aggressively subsumed : 0
% 0.13/0.41 # Contextual simplify-reflections : 0
% 0.13/0.41 # Paramodulations : 212
% 0.13/0.41 # Factorizations : 0
% 0.13/0.41 # NegExts : 0
% 0.13/0.41 # Equation resolutions : 0
% 0.13/0.41 # Disequality decompositions : 0
% 0.13/0.41 # Total rewrite steps : 143
% 0.13/0.41 # ...of those cached : 62
% 0.13/0.41 # Propositional unsat checks : 0
% 0.13/0.41 # Propositional check models : 0
% 0.13/0.41 # Propositional check unsatisfiable : 0
% 0.13/0.41 # Propositional clauses : 0
% 0.13/0.41 # Propositional clauses after purity: 0
% 0.13/0.41 # Propositional unsat core size : 0
% 0.13/0.41 # Propositional preprocessing time : 0.000
% 0.13/0.41 # Propositional encoding time : 0.000
% 0.13/0.41 # Propositional solver time : 0.000
% 0.13/0.41 # Success case prop preproc time : 0.000
% 0.13/0.41 # Success case prop encoding time : 0.000
% 0.13/0.41 # Success case prop solver time : 0.000
% 0.13/0.41 # Current number of processed clauses : 10
% 0.13/0.41 # Positive orientable unit clauses : 8
% 0.13/0.41 # Positive unorientable unit clauses: 2
% 0.13/0.41 # Negative unit clauses : 0
% 0.13/0.41 # Non-unit-clauses : 0
% 0.13/0.41 # Current number of unprocessed clauses: 116
% 0.13/0.41 # ...number of literals in the above : 116
% 0.13/0.41 # Current number of archived formulas : 0
% 0.13/0.41 # Current number of archived clauses : 12
% 0.13/0.41 # Clause-clause subsumption calls (NU) : 0
% 0.13/0.41 # Rec. Clause-clause subsumption calls : 0
% 0.13/0.41 # Non-unit clause-clause subsumptions : 0
% 0.13/0.41 # Unit Clause-clause subsumption calls : 12
% 0.13/0.41 # Rewrite failures with RHS unbound : 0
% 0.13/0.41 # BW rewrite match attempts : 67
% 0.13/0.41 # BW rewrite match successes : 18
% 0.13/0.41 # Condensation attempts : 0
% 0.13/0.41 # Condensation successes : 0
% 0.13/0.41 # Termbank termtop insertions : 1774
% 0.13/0.41 # Search garbage collected termcells : 2
% 0.13/0.41
% 0.13/0.41 # -------------------------------------------------
% 0.13/0.41 # User time : 0.003 s
% 0.13/0.41 # System time : 0.001 s
% 0.13/0.41 # Total time : 0.004 s
% 0.13/0.41 # Maximum resident set size: 1608 pages
% 0.13/0.41
% 0.13/0.41 # -------------------------------------------------
% 0.13/0.41 # User time : 0.004 s
% 0.13/0.41 # System time : 0.002 s
% 0.13/0.41 # Total time : 0.006 s
% 0.13/0.41 # Maximum resident set size: 1684 pages
% 0.13/0.41 % E---3.1 exiting
% 0.13/0.41 % E exiting
%------------------------------------------------------------------------------