TSTP Solution File: GRP500-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP500-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:41:24 EDT 2023
% Result : Unsatisfiable 0.24s 0.65s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 3
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 8 RR)
% Number of literals : 37 ( 36 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 3 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 : 93 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X3))),double_divide(X4,double_divide(X2,X4))))) = X3,
file('/export/starexec/sandbox2/tmp/tmp.ddaYqibJJV/E---3.1_25592.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/tmp/tmp.ddaYqibJJV/E---3.1_25592.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.ddaYqibJJV/E---3.1_25592.p',multiply) ).
cnf(c_0_3,axiom,
double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X3))),double_divide(X4,double_divide(X2,X4))))) = X3,
single_axiom ).
cnf(c_0_4,plain,
double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X1,X2)),double_divide(X3,double_divide(inverse(X4),X3))))) = inverse(double_divide(inverse(double_divide(X4,double_divide(X5,X2))),double_divide(X6,double_divide(X5,X6)))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(double_divide(inverse(double_divide(X1,double_divide(X2,double_divide(inverse(X1),X3)))),double_divide(X4,double_divide(X2,X4)))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
double_divide(X1,inverse(double_divide(inverse(double_divide(double_divide(inverse(double_divide(X2,double_divide(X3,double_divide(inverse(X2),X1)))),double_divide(X4,double_divide(X3,X4))),double_divide(X5,X6))),double_divide(X7,double_divide(X5,X7))))) = X6,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
double_divide(X1,double_divide(inverse(X2),inverse(double_divide(inverse(double_divide(X2,X3)),double_divide(X4,double_divide(X1,X4)))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_4]),c_0_5]) ).
cnf(c_0_8,plain,
double_divide(inverse(inverse(double_divide(X1,double_divide(X2,double_divide(inverse(X1),X3))))),inverse(double_divide(X3,double_divide(X4,double_divide(X5,X4))))) = double_divide(X2,X5),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_9,plain,
double_divide(X1,double_divide(X2,X1)) = double_divide(X3,double_divide(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_8]) ).
cnf(c_0_10,plain,
double_divide(inverse(inverse(double_divide(X1,double_divide(X2,double_divide(inverse(X1),inverse(double_divide(X3,double_divide(X4,double_divide(inverse(X3),X5))))))))),X5) = double_divide(X2,X4),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_11,plain,
double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X2,double_divide(X3,X2))),double_divide(X4,double_divide(X3,X4))))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_12,plain,
inverse(double_divide(inverse(double_divide(X1,double_divide(X2,double_divide(inverse(X1),X2)))),double_divide(X3,double_divide(X4,X3)))) = X4,
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_13,plain,
inverse(double_divide(X1,double_divide(X2,double_divide(inverse(X1),inverse(double_divide(X3,double_divide(X4,X3))))))) = double_divide(X2,X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
cnf(c_0_14,plain,
inverse(double_divide(double_divide(inverse(double_divide(X1,double_divide(X2,X1))),X2),double_divide(X3,double_divide(X4,X3)))) = X4,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
inverse(double_divide(inverse(double_divide(inverse(double_divide(X1,double_divide(X2,X1))),X2)),double_divide(X3,double_divide(X4,X3)))) = X4,
inference(spm,[status(thm)],[c_0_5,c_0_14]) ).
cnf(c_0_16,plain,
double_divide(X1,double_divide(inverse(inverse(double_divide(X2,double_divide(X3,X2)))),X1)) = X3,
inference(spm,[status(thm)],[c_0_7,c_0_15]) ).
cnf(c_0_17,plain,
double_divide(inverse(X1),inverse(double_divide(inverse(X2),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_16]),c_0_16]) ).
cnf(c_0_18,plain,
double_divide(X1,double_divide(inverse(X2),X1)) = double_divide(inverse(double_divide(inverse(X3),X3)),X2),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_19,plain,
double_divide(inverse(X1),inverse(double_divide(X2,inverse(X2)))) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_8]) ).
cnf(c_0_20,plain,
inverse(double_divide(X1,inverse(double_divide(inverse(X2),X2)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_18]),c_0_12]) ).
cnf(c_0_21,plain,
double_divide(inverse(X1),double_divide(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_23,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_22,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_25,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_26,plain,
double_divide(X1,inverse(X1)) = double_divide(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]) ).
cnf(c_0_28,plain,
double_divide(X1,inverse(X1)) = inverse(double_divide(b2,inverse(b2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_26]),c_0_22]),c_0_22]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
inverse(double_divide(a2,double_divide(X1,inverse(X1)))) != a2,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
inverse(double_divide(a2,double_divide(double_divide(double_divide(b2,inverse(b2)),X1),X1))) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_14]),c_0_22]),c_0_26]),c_0_22]) ).
cnf(c_0_31,plain,
double_divide(inverse(X1),double_divide(b2,inverse(b2))) = X1,
inference(rw,[status(thm)],[c_0_21,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
inverse(double_divide(double_divide(b2,inverse(b2)),a2)) != a2,
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_33,plain,
double_divide(X1,inverse(X1)) = double_divide(b2,inverse(b2)),
inference(spm,[status(thm)],[c_0_23,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
inverse(double_divide(double_divide(X1,inverse(X1)),a2)) != a2,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_22]),c_0_22]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_23]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP500-1 : TPTP v8.1.2. Released v2.6.0.
% 0.13/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n020.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 2400
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Tue Oct 3 02:19:01 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.ddaYqibJJV/E---3.1_25592.p
% 0.24/0.65 # Version: 3.1pre001
% 0.24/0.65 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.65 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.65 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.65 # Starting sh5l with 300s (1) cores
% 0.24/0.65 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 25722 completed with status 0
% 0.24/0.65 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.24/0.65 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.65 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.65 # No SInE strategy applied
% 0.24/0.65 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.24/0.65 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.24/0.65 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.24/0.65 # Starting new_bool_3 with 136s (1) cores
% 0.24/0.65 # Starting new_bool_1 with 136s (1) cores
% 0.24/0.65 # Starting sh5l with 136s (1) cores
% 0.24/0.65 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 25732 completed with status 0
% 0.24/0.65 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.24/0.65 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.65 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.65 # No SInE strategy applied
% 0.24/0.65 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.24/0.65 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.65 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.24/0.65 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.24/0.65 # Preprocessing time : 0.001 s
% 0.24/0.65
% 0.24/0.65 # Proof found!
% 0.24/0.65 # SZS status Unsatisfiable
% 0.24/0.65 # SZS output start CNFRefutation
% See solution above
% 0.24/0.65 # Parsed axioms : 3
% 0.24/0.65 # Removed by relevancy pruning/SinE : 0
% 0.24/0.65 # Initial clauses : 3
% 0.24/0.65 # Removed in clause preprocessing : 1
% 0.24/0.65 # Initial clauses in saturation : 2
% 0.24/0.65 # Processed clauses : 141
% 0.24/0.65 # ...of these trivial : 20
% 0.24/0.65 # ...subsumed : 63
% 0.24/0.65 # ...remaining for further processing : 58
% 0.24/0.65 # Other redundant clauses eliminated : 0
% 0.24/0.65 # Clauses deleted for lack of memory : 0
% 0.24/0.65 # Backward-subsumed : 2
% 0.24/0.65 # Backward-rewritten : 24
% 0.24/0.65 # Generated clauses : 6132
% 0.24/0.65 # ...of the previous two non-redundant : 5768
% 0.24/0.65 # ...aggressively subsumed : 0
% 0.24/0.65 # Contextual simplify-reflections : 0
% 0.24/0.65 # Paramodulations : 6132
% 0.24/0.65 # Factorizations : 0
% 0.24/0.65 # NegExts : 0
% 0.24/0.65 # Equation resolutions : 0
% 0.24/0.65 # Total rewrite steps : 3657
% 0.24/0.65 # Propositional unsat checks : 0
% 0.24/0.65 # Propositional check models : 0
% 0.24/0.65 # Propositional check unsatisfiable : 0
% 0.24/0.65 # Propositional clauses : 0
% 0.24/0.65 # Propositional clauses after purity: 0
% 0.24/0.65 # Propositional unsat core size : 0
% 0.24/0.65 # Propositional preprocessing time : 0.000
% 0.24/0.65 # Propositional encoding time : 0.000
% 0.24/0.65 # Propositional solver time : 0.000
% 0.24/0.65 # Success case prop preproc time : 0.000
% 0.24/0.65 # Success case prop encoding time : 0.000
% 0.24/0.65 # Success case prop solver time : 0.000
% 0.24/0.65 # Current number of processed clauses : 32
% 0.24/0.65 # Positive orientable unit clauses : 18
% 0.24/0.65 # Positive unorientable unit clauses: 8
% 0.24/0.65 # Negative unit clauses : 6
% 0.24/0.65 # Non-unit-clauses : 0
% 0.24/0.65 # Current number of unprocessed clauses: 5572
% 0.24/0.65 # ...number of literals in the above : 5572
% 0.24/0.65 # Current number of archived formulas : 0
% 0.24/0.65 # Current number of archived clauses : 27
% 0.24/0.65 # Clause-clause subsumption calls (NU) : 0
% 0.24/0.65 # Rec. Clause-clause subsumption calls : 0
% 0.24/0.65 # Non-unit clause-clause subsumptions : 0
% 0.24/0.65 # Unit Clause-clause subsumption calls : 119
% 0.24/0.65 # Rewrite failures with RHS unbound : 0
% 0.24/0.65 # BW rewrite match attempts : 409
% 0.24/0.65 # BW rewrite match successes : 61
% 0.24/0.65 # Condensation attempts : 0
% 0.24/0.65 # Condensation successes : 0
% 0.24/0.65 # Termbank termtop insertions : 118940
% 0.24/0.65
% 0.24/0.65 # -------------------------------------------------
% 0.24/0.65 # User time : 0.096 s
% 0.24/0.65 # System time : 0.013 s
% 0.24/0.65 # Total time : 0.108 s
% 0.24/0.65 # Maximum resident set size: 1556 pages
% 0.24/0.65
% 0.24/0.65 # -------------------------------------------------
% 0.24/0.65 # User time : 0.429 s
% 0.24/0.65 # System time : 0.023 s
% 0.24/0.65 # Total time : 0.451 s
% 0.24/0.65 # Maximum resident set size: 1672 pages
% 0.24/0.65 % E---3.1 exiting
% 0.24/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------