TSTP Solution File: GRP559-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP559-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:42:07 EDT 2023
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 7 RR)
% Number of literals : 33 ( 32 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(X1,inverse(divide(divide(X2,X3),divide(X1,X3)))) = X2,
file('/export/starexec/sandbox/tmp/tmp.rUjwR7EtUJ/E---3.1_10540.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/tmp/tmp.rUjwR7EtUJ/E---3.1_10540.p',prove_these_axioms_3) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox/tmp/tmp.rUjwR7EtUJ/E---3.1_10540.p',multiply) ).
cnf(c_0_3,axiom,
divide(X1,inverse(divide(divide(X2,X3),divide(X1,X3)))) = X2,
single_axiom ).
cnf(c_0_4,plain,
divide(X1,inverse(divide(X2,divide(X1,inverse(divide(divide(X2,X3),divide(X4,X3))))))) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
divide(X1,inverse(divide(X2,X2))) = X1,
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_6,plain,
divide(X1,inverse(divide(X2,X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_5]),c_0_5]) ).
cnf(c_0_7,plain,
divide(inverse(divide(X1,X2)),inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_8,plain,
inverse(divide(divide(X1,X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,plain,
divide(X1,divide(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_10,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_11,plain,
divide(X1,inverse(inverse(divide(X2,X2)))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_12,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_10]),c_0_10]) ).
cnf(c_0_13,plain,
divide(divide(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_14,plain,
divide(divide(X1,X2),X1) = inverse(X2),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_15,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_12]) ).
cnf(c_0_16,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_17,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_18,plain,
divide(X1,divide(divide(X1,X2),divide(X3,X2))) = X3,
inference(rw,[status(thm)],[c_0_3,c_0_10]) ).
cnf(c_0_19,plain,
divide(inverse(X1),inverse(X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
divide(divide(X1,inverse(X2)),X2) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_22,plain,
divide(inverse(X1),divide(divide(X2,X1),X3)) = divide(X3,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_18]),c_0_19]),c_0_10]) ).
cnf(c_0_23,plain,
divide(X1,divide(X2,inverse(X1))) = inverse(X2),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference(rw,[status(thm)],[c_0_21,c_0_10]) ).
cnf(c_0_25,plain,
divide(divide(X1,X2),X3) = divide(inverse(X2),divide(X3,X1)),
inference(spm,[status(thm)],[c_0_9,c_0_22]) ).
cnf(c_0_26,plain,
divide(X1,inverse(X2)) = divide(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_9,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
divide(c3,divide(inverse(a3),b3)) != divide(a3,divide(inverse(b3),c3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_19]),c_0_15]),c_0_10]),c_0_19]),c_0_15]),c_0_19]),c_0_15]) ).
cnf(c_0_28,plain,
divide(X1,divide(X2,X3)) = divide(X3,divide(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_25]),c_0_15]),c_0_15]) ).
cnf(c_0_29,plain,
divide(inverse(X1),X2) = divide(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_30,negated_conjecture,
divide(b3,divide(inverse(a3),c3)) != divide(a3,divide(inverse(b3),c3)),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
divide(X1,divide(inverse(X2),X3)) = divide(X3,divide(inverse(X1),X2)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_19]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP559-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 03:01:21 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.rUjwR7EtUJ/E---3.1_10540.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # sh5l with pid 10621 completed with status 0
% 0.20/0.51 # Result found by sh5l
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.20/0.51 # U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 10627 completed with status 0
% 0.20/0.51 # Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 3
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 3
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 3
% 0.20/0.51 # Processed clauses : 254
% 0.20/0.51 # ...of these trivial : 24
% 0.20/0.51 # ...subsumed : 187
% 0.20/0.51 # ...remaining for further processing : 43
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 19
% 0.20/0.51 # Generated clauses : 1289
% 0.20/0.51 # ...of the previous two non-redundant : 814
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 1289
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Total rewrite steps : 2872
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 21
% 0.20/0.51 # Positive orientable unit clauses : 11
% 0.20/0.51 # Positive unorientable unit clauses: 10
% 0.20/0.51 # Negative unit clauses : 0
% 0.20/0.51 # Non-unit-clauses : 0
% 0.20/0.51 # Current number of unprocessed clauses: 363
% 0.20/0.51 # ...number of literals in the above : 363
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 22
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.51 # Non-unit clause-clause subsumptions : 0
% 0.20/0.51 # Unit Clause-clause subsumption calls : 37
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 166
% 0.20/0.51 # BW rewrite match successes : 114
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 12801
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.013 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.016 s
% 0.20/0.51 # Maximum resident set size: 1416 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.014 s
% 0.20/0.51 # System time : 0.004 s
% 0.20/0.51 # Total time : 0.018 s
% 0.20/0.51 # Maximum resident set size: 1680 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------