TSTP Solution File: GRP613-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP613-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:16 EDT 2023
% Result : Unsatisfiable 0.23s 0.53s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 4 RR)
% Number of literals : 20 ( 19 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 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 : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(inverse(double_divide(inverse(double_divide(X1,inverse(X2))),X3)),double_divide(X1,X3)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.Z6tPWPtiEC/E---3.1_11988.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/tmp/tmp.Z6tPWPtiEC/E---3.1_11988.p',prove_these_axioms_1) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.Z6tPWPtiEC/E---3.1_11988.p',multiply) ).
cnf(c_0_3,axiom,
double_divide(inverse(double_divide(inverse(double_divide(X1,inverse(X2))),X3)),double_divide(X1,X3)) = X2,
single_axiom ).
cnf(c_0_4,plain,
double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(X1,inverse(X2))),X3)),inverse(X4))),double_divide(X1,X3))),X2) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
double_divide(inverse(double_divide(inverse(X1),inverse(X2))),X1) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_4]),c_0_3]) ).
cnf(c_0_6,plain,
double_divide(inverse(X1),double_divide(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
double_divide(inverse(X1),double_divide(inverse(double_divide(X2,inverse(X1))),double_divide(X2,inverse(X3)))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_8,plain,
double_divide(inverse(double_divide(inverse(X1),X1)),inverse(X2)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
double_divide(inverse(X1),double_divide(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_10,plain,
double_divide(inverse(double_divide(inverse(X1),X1)),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_12,plain,
double_divide(X1,double_divide(inverse(X2),X2)) = inverse(X1),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
prove_these_axioms_1 ).
cnf(c_0_14,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_15,plain,
double_divide(inverse(X1),double_divide(X2,inverse(X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_11]),c_0_11]) ).
cnf(c_0_16,negated_conjecture,
inverse(double_divide(b1,inverse(b1))) != inverse(double_divide(a1,inverse(a1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_17,plain,
inverse(double_divide(X1,inverse(X2))) = double_divide(inverse(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_5]),c_0_11]) ).
cnf(c_0_18,plain,
double_divide(inverse(X1),X1) = double_divide(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : GRP613-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n007.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Oct 3 02:06:54 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.Z6tPWPtiEC/E---3.1_11988.p
% 0.23/0.53 # Version: 3.1pre001
% 0.23/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 12066 completed with status 0
% 0.23/0.53 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.23/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.53 # No SInE strategy applied
% 0.23/0.53 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.23/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.23/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.23/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.23/0.53 # Starting sh5l with 136s (1) cores
% 0.23/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12070 completed with status 0
% 0.23/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.53 # No SInE strategy applied
% 0.23/0.53 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.23/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.23/0.53 # Preprocessing time : 0.001 s
% 0.23/0.53 # Presaturation interreduction done
% 0.23/0.53
% 0.23/0.53 # Proof found!
% 0.23/0.53 # SZS status Unsatisfiable
% 0.23/0.53 # SZS output start CNFRefutation
% See solution above
% 0.23/0.53 # Parsed axioms : 3
% 0.23/0.53 # Removed by relevancy pruning/SinE : 0
% 0.23/0.53 # Initial clauses : 3
% 0.23/0.53 # Removed in clause preprocessing : 1
% 0.23/0.53 # Initial clauses in saturation : 2
% 0.23/0.53 # Processed clauses : 26
% 0.23/0.53 # ...of these trivial : 7
% 0.23/0.53 # ...subsumed : 0
% 0.23/0.53 # ...remaining for further processing : 19
% 0.23/0.53 # Other redundant clauses eliminated : 0
% 0.23/0.53 # Clauses deleted for lack of memory : 0
% 0.23/0.53 # Backward-subsumed : 0
% 0.23/0.53 # Backward-rewritten : 5
% 0.23/0.53 # Generated clauses : 270
% 0.23/0.53 # ...of the previous two non-redundant : 196
% 0.23/0.53 # ...aggressively subsumed : 0
% 0.23/0.53 # Contextual simplify-reflections : 0
% 0.23/0.53 # Paramodulations : 270
% 0.23/0.53 # Factorizations : 0
% 0.23/0.53 # NegExts : 0
% 0.23/0.53 # Equation resolutions : 0
% 0.23/0.53 # Total rewrite steps : 187
% 0.23/0.53 # Propositional unsat checks : 0
% 0.23/0.53 # Propositional check models : 0
% 0.23/0.53 # Propositional check unsatisfiable : 0
% 0.23/0.53 # Propositional clauses : 0
% 0.23/0.53 # Propositional clauses after purity: 0
% 0.23/0.53 # Propositional unsat core size : 0
% 0.23/0.53 # Propositional preprocessing time : 0.000
% 0.23/0.53 # Propositional encoding time : 0.000
% 0.23/0.53 # Propositional solver time : 0.000
% 0.23/0.53 # Success case prop preproc time : 0.000
% 0.23/0.53 # Success case prop encoding time : 0.000
% 0.23/0.53 # Success case prop solver time : 0.000
% 0.23/0.53 # Current number of processed clauses : 12
% 0.23/0.53 # Positive orientable unit clauses : 11
% 0.23/0.53 # Positive unorientable unit clauses: 1
% 0.23/0.53 # Negative unit clauses : 0
% 0.23/0.53 # Non-unit-clauses : 0
% 0.23/0.53 # Current number of unprocessed clauses: 172
% 0.23/0.53 # ...number of literals in the above : 172
% 0.23/0.53 # Current number of archived formulas : 0
% 0.23/0.53 # Current number of archived clauses : 8
% 0.23/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.23/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.23/0.53 # Non-unit clause-clause subsumptions : 0
% 0.23/0.53 # Unit Clause-clause subsumption calls : 7
% 0.23/0.53 # Rewrite failures with RHS unbound : 0
% 0.23/0.53 # BW rewrite match attempts : 50
% 0.23/0.53 # BW rewrite match successes : 8
% 0.23/0.53 # Condensation attempts : 0
% 0.23/0.53 # Condensation successes : 0
% 0.23/0.53 # Termbank termtop insertions : 3227
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.004 s
% 0.23/0.53 # System time : 0.003 s
% 0.23/0.53 # Total time : 0.006 s
% 0.23/0.53 # Maximum resident set size: 1556 pages
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.025 s
% 0.23/0.53 # System time : 0.006 s
% 0.23/0.53 # Total time : 0.031 s
% 0.23/0.53 # Maximum resident set size: 1672 pages
% 0.23/0.53 % E---3.1 exiting
% 0.23/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------