TSTP Solution File: GRP610-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP610-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:49:36 EDT 2023
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 6 RR)
% Number of literals : 29 ( 28 equ; 5 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 : 58 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(double_divide(inverse(double_divide(inverse(double_divide(X1,X2)),X3)),double_divide(X1,X3))) = X2,
file('/export/starexec/sandbox2/tmp/tmp.o4p9WF2Fuc/E---3.1_14884.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/tmp/tmp.o4p9WF2Fuc/E---3.1_14884.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.o4p9WF2Fuc/E---3.1_14884.p',multiply) ).
cnf(c_0_3,axiom,
inverse(double_divide(inverse(double_divide(inverse(double_divide(X1,X2)),X3)),double_divide(X1,X3))) = X2,
single_axiom ).
cnf(c_0_4,plain,
inverse(double_divide(X1,double_divide(inverse(double_divide(X2,X1)),double_divide(X2,X3)))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(double_divide(inverse(double_divide(X1,X2)),double_divide(inverse(double_divide(inverse(double_divide(X3,X1)),X4)),X2))) = double_divide(X3,X4),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_6,plain,
double_divide(X1,inverse(double_divide(X2,double_divide(inverse(double_divide(X1,X2)),X3)))) = X3,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
double_divide(inverse(double_divide(X1,X2)),double_divide(X1,inverse(double_divide(X2,X3)))) = X3,
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
inverse(double_divide(inverse(X1),double_divide(X2,double_divide(X2,inverse(double_divide(X3,X1)))))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
double_divide(inverse(double_divide(X1,inverse(X2))),inverse(double_divide(X3,X2))) = double_divide(X1,X3),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(X1,inverse(double_divide(inverse(X2),double_divide(X1,X3)))) = inverse(double_divide(X3,X2)),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_11,plain,
inverse(double_divide(X1,double_divide(inverse(double_divide(X2,X3)),X1))) = double_divide(X2,X3),
inference(spm,[status(thm)],[c_0_10,c_0_3]) ).
cnf(c_0_12,plain,
double_divide(X1,double_divide(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_11]) ).
cnf(c_0_13,plain,
inverse(inverse(double_divide(X1,X2))) = double_divide(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_14,plain,
double_divide(inverse(X1),inverse(X2)) = inverse(double_divide(X2,X1)),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_15,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_16,plain,
inverse(double_divide(double_divide(X1,X2),X2)) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_14]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_18,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_19,plain,
double_divide(double_divide(X1,X2),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_21,plain,
inverse(double_divide(X1,inverse(X2))) = double_divide(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
double_divide(double_divide(b2,inverse(b2)),inverse(a2)) != a2,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
double_divide(X1,X2) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_25,plain,
double_divide(inverse(double_divide(X1,X2)),X3) = double_divide(X1,inverse(double_divide(X2,X3))),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_26,negated_conjecture,
double_divide(inverse(a2),double_divide(b2,inverse(b2))) != a2,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
double_divide(X1,double_divide(X2,inverse(X3))) = inverse(double_divide(X2,double_divide(X1,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_21]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_24]),c_0_12]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP610-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.09/0.31 % Computer : n019.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 2400
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Tue Oct 3 02:18:51 EDT 2023
% 0.09/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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/tmp/tmp.o4p9WF2Fuc/E---3.1_14884.p
% 0.15/0.44 # Version: 3.1pre001
% 0.15/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 14961 completed with status 0
% 0.15/0.44 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.44 # No SInE strategy applied
% 0.15/0.44 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.15/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.15/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.44 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.44 # Starting sh5l with 136s (1) cores
% 0.15/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 14966 completed with status 0
% 0.15/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.44 # No SInE strategy applied
% 0.15/0.44 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.15/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.15/0.44 # Preprocessing time : 0.001 s
% 0.15/0.44 # Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Unsatisfiable
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.44 # Parsed axioms : 3
% 0.15/0.44 # Removed by relevancy pruning/SinE : 0
% 0.15/0.44 # Initial clauses : 3
% 0.15/0.44 # Removed in clause preprocessing : 1
% 0.15/0.44 # Initial clauses in saturation : 2
% 0.15/0.44 # Processed clauses : 45
% 0.15/0.44 # ...of these trivial : 3
% 0.15/0.44 # ...subsumed : 10
% 0.15/0.44 # ...remaining for further processing : 32
% 0.15/0.44 # Other redundant clauses eliminated : 0
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 0
% 0.15/0.44 # Backward-rewritten : 17
% 0.15/0.44 # Generated clauses : 664
% 0.15/0.44 # ...of the previous two non-redundant : 592
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 0
% 0.15/0.44 # Paramodulations : 664
% 0.15/0.44 # Factorizations : 0
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 0
% 0.15/0.44 # Total rewrite steps : 365
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 13
% 0.15/0.44 # Positive orientable unit clauses : 12
% 0.15/0.44 # Positive unorientable unit clauses: 1
% 0.15/0.44 # Negative unit clauses : 0
% 0.15/0.44 # Non-unit-clauses : 0
% 0.15/0.44 # Current number of unprocessed clauses: 530
% 0.15/0.44 # ...number of literals in the above : 530
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 20
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.44 # Non-unit clause-clause subsumptions : 0
% 0.15/0.44 # Unit Clause-clause subsumption calls : 9
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 94
% 0.15/0.44 # BW rewrite match successes : 55
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 6747
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.009 s
% 0.15/0.44 # System time : 0.002 s
% 0.15/0.44 # Total time : 0.011 s
% 0.15/0.44 # Maximum resident set size: 1556 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.045 s
% 0.15/0.44 # System time : 0.008 s
% 0.15/0.44 # Total time : 0.053 s
% 0.15/0.44 # Maximum resident set size: 1672 pages
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------