TSTP Solution File: GRP451-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP451-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:19 EDT 2024
% Result : Unsatisfiable 0.22s 0.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 4 RR)
% Number of literals : 18 ( 17 equ; 3 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
file('/export/starexec/sandbox2/tmp/tmp.5AGUkrxMTD/E---3.1_872.p',multiply) ).
cnf(inverse,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
file('/export/starexec/sandbox2/tmp/tmp.5AGUkrxMTD/E---3.1_872.p',inverse) ).
cnf(single_axiom,axiom,
divide(divide(divide(X1,X1),divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),X3)))),X3) = X2,
file('/export/starexec/sandbox2/tmp/tmp.5AGUkrxMTD/E---3.1_872.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/tmp/tmp.5AGUkrxMTD/E---3.1_872.p',prove_these_axioms_1) ).
cnf(c_0_4,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
multiply ).
cnf(c_0_5,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
inverse ).
cnf(c_0_6,axiom,
divide(divide(divide(X1,X1),divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),X3)))),X3) = X2,
single_axiom ).
cnf(c_0_7,plain,
divide(X1,inverse(X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,plain,
divide(inverse(divide(X1,divide(X2,divide(inverse(X1),X3)))),X3) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_5]),c_0_5]) ).
cnf(c_0_9,plain,
divide(inverse(divide(X1,X1)),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_10,plain,
multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_11,plain,
divide(inverse(inverse(multiply(X1,X2))),X2) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_7]),c_0_5]) ).
cnf(c_0_12,plain,
multiply(multiply(inverse(X1),X1),X2) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_13,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(fof_simplification,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_0_14,plain,
divide(inverse(inverse(inverse(inverse(X1)))),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
c_0_13 ).
cnf(c_0_16,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP451-1 : TPTP v8.1.2. Released v2.6.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.16/0.35 % Computer : n008.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Fri May 3 16:09:08 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.5AGUkrxMTD/E---3.1_872.p
% 0.22/0.50 # Version: 3.1.0
% 0.22/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # Starting sh5l with 300s (1) cores
% 0.22/0.50 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 965 completed with status 0
% 0.22/0.50 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.22/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50 # No SInE strategy applied
% 0.22/0.50 # Search class: FUUPS-FFSF21-DFFFFFNN
% 0.22/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.50 # Starting sh5l with 136s (1) cores
% 0.22/0.50 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 971 completed with status 0
% 0.22/0.51 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.22/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.51 # No SInE strategy applied
% 0.22/0.51 # Search class: FUUPS-FFSF21-DFFFFFNN
% 0.22/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.22/0.51 # Preprocessing time : 0.001 s
% 0.22/0.51
% 0.22/0.51 # Proof found!
% 0.22/0.51 # SZS status Unsatisfiable
% 0.22/0.51 # SZS output start CNFRefutation
% See solution above
% 0.22/0.51 # Parsed axioms : 4
% 0.22/0.51 # Removed by relevancy pruning/SinE : 0
% 0.22/0.51 # Initial clauses : 4
% 0.22/0.51 # Removed in clause preprocessing : 0
% 0.22/0.51 # Initial clauses in saturation : 4
% 0.22/0.51 # Processed clauses : 14
% 0.22/0.51 # ...of these trivial : 1
% 0.22/0.51 # ...subsumed : 0
% 0.22/0.51 # ...remaining for further processing : 13
% 0.22/0.51 # Other redundant clauses eliminated : 0
% 0.22/0.51 # Clauses deleted for lack of memory : 0
% 0.22/0.51 # Backward-subsumed : 0
% 0.22/0.51 # Backward-rewritten : 0
% 0.22/0.51 # Generated clauses : 96
% 0.22/0.51 # ...of the previous two non-redundant : 78
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 0
% 0.22/0.51 # Paramodulations : 95
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 29
% 0.22/0.51 # ...of those cached : 8
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 12
% 0.22/0.51 # Positive orientable unit clauses : 10
% 0.22/0.51 # Positive unorientable unit clauses: 2
% 0.22/0.51 # Negative unit clauses : 0
% 0.22/0.51 # Non-unit-clauses : 0
% 0.22/0.51 # Current number of unprocessed clauses: 68
% 0.22/0.51 # ...number of literals in the above : 68
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 1
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.51 # Non-unit clause-clause subsumptions : 0
% 0.22/0.51 # Unit Clause-clause subsumption calls : 2
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 18
% 0.22/0.51 # BW rewrite match successes : 11
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 1070
% 0.22/0.51 # Search garbage collected termcells : 2
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.005 s
% 0.22/0.51 # System time : 0.001 s
% 0.22/0.51 # Total time : 0.006 s
% 0.22/0.51 # Maximum resident set size: 1552 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.017 s
% 0.22/0.51 # System time : 0.005 s
% 0.22/0.51 # Total time : 0.022 s
% 0.22/0.51 # Maximum resident set size: 1688 pages
% 0.22/0.51 % E---3.1 exiting
% 0.22/0.51 % E exiting
%------------------------------------------------------------------------------