TSTP Solution File: GRP476-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP476-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:48:40 EDT 2023
% Result : Timeout 0.48s 300.19s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 4 RR)
% Number of literals : 31 ( 30 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 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 : 105 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(inverse(divide(divide(divide(X1,X2),X3),divide(X4,X3))),divide(X2,X1)) = X4,
file('/export/starexec/sandbox/tmp/tmp.3RkdSkYI7I/E---3.1_28703.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/tmp/tmp.3RkdSkYI7I/E---3.1_28703.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox/tmp/tmp.3RkdSkYI7I/E---3.1_28703.p',multiply) ).
cnf(c_0_3,axiom,
divide(inverse(divide(divide(divide(X1,X2),X3),divide(X4,X3))),divide(X2,X1)) = X4,
single_axiom ).
cnf(c_0_4,plain,
divide(inverse(divide(divide(divide(X1,X2),divide(X3,X4)),X5)),divide(X2,X1)) = inverse(divide(divide(divide(X4,X3),X6),divide(X5,X6))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(divide(divide(divide(X1,X2),X3),divide(divide(X4,divide(X2,X1)),X3))) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
divide(inverse(divide(divide(X1,X2),divide(X3,X2))),divide(divide(X4,X5),inverse(divide(divide(divide(X5,X4),X6),divide(X1,X6))))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_7,plain,
divide(inverse(divide(divide(divide(divide(X1,X2),inverse(divide(divide(divide(X2,X1),X3),divide(X4,X3)))),X5),divide(X6,X5))),X4) = X6,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_8,plain,
inverse(divide(divide(X1,X2),divide(X3,X2))) = inverse(divide(divide(X1,X4),divide(X3,X4))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_3]) ).
cnf(c_0_9,plain,
divide(divide(inverse(divide(divide(divide(X1,X2),X3),X4)),divide(X2,X1)),X3) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_4]),c_0_3]) ).
cnf(c_0_10,plain,
divide(X1,divide(divide(X2,X3),inverse(divide(divide(divide(X3,X2),X4),divide(divide(X5,X6),X4))))) = divide(X1,divide(X6,X5)),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_11,plain,
inverse(divide(divide(X1,X2),divide(inverse(divide(divide(divide(X3,X4),X5),divide(X6,X5))),X2))) = inverse(divide(divide(X1,divide(X4,X3)),X6)),
inference(spm,[status(thm)],[c_0_8,c_0_3]) ).
cnf(c_0_12,plain,
divide(divide(X1,X2),inverse(divide(divide(divide(X2,X1),X3),divide(divide(X4,X5),X3)))) = divide(X5,X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_9]) ).
cnf(c_0_13,plain,
divide(inverse(divide(X1,divide(X2,X3))),divide(divide(X4,X5),inverse(divide(divide(divide(X5,X4),X3),X1)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_11]),c_0_3]) ).
cnf(c_0_14,plain,
inverse(divide(divide(divide(X1,divide(X2,X3)),X4),divide(divide(X5,X6),X4))) = divide(divide(inverse(divide(X6,X5)),divide(X3,X2)),X1),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_15,plain,
divide(divide(divide(inverse(divide(X1,X2)),divide(X3,X4)),X5),divide(divide(X4,X3),X5)) = divide(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).
cnf(c_0_16,plain,
inverse(divide(X1,divide(divide(X2,divide(divide(X3,X4),inverse(divide(divide(divide(X4,X3),X5),X1)))),X5))) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_17,plain,
divide(divide(divide(X1,X2),inverse(divide(X3,X4))),inverse(divide(X4,X3))) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_18,plain,
divide(inverse(divide(X1,X2)),divide(divide(X3,X4),inverse(divide(X2,X1)))) = divide(X4,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_15]),c_0_12]) ).
cnf(c_0_19,plain,
inverse(divide(divide(divide(X1,X2),inverse(divide(X2,X1))),X3)) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,plain,
divide(divide(X1,inverse(X2)),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_19]),c_0_3]) ).
cnf(c_0_21,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
divide(X1,divide(divide(X2,X3),divide(X2,X3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_21]),c_0_21]) ).
cnf(c_0_23,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_24,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_25,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_22]) ).
cnf(c_0_26,plain,
divide(X1,inverse(inverse(X2))) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_28,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_29,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_26]),c_0_9]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : GRP476-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n002.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Tue Oct 3 02:49:59 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.19/0.50 Running first-order model finding
% 0.19/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.3RkdSkYI7I/E---3.1_28703.p
% 0.48/300.19 # Version: 3.1pre001
% 0.48/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.48/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.48/300.19 # Starting new_bool_3 with 300s (1) cores
% 0.48/300.19 # Starting new_bool_1 with 300s (1) cores
% 0.48/300.19 # Starting sh5l with 300s (1) cores
% 0.48/300.19 # new_bool_1 with pid 28796 completed with status 0
% 0.48/300.19 # Result found by new_bool_1
% 0.48/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.48/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.48/300.19 # Starting new_bool_3 with 300s (1) cores
% 0.48/300.19 # Starting new_bool_1 with 300s (1) cores
% 0.48/300.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.48/300.19 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.48/300.19 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.48/300.19 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.48/300.19 # U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 28798 completed with status 0
% 0.48/300.19 # Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.48/300.19 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.48/300.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/300.19 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.48/300.19 # Starting new_bool_3 with 300s (1) cores
% 0.48/300.19 # Starting new_bool_1 with 300s (1) cores
% 0.48/300.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.48/300.19 # Search class: FUUPS-FFSF21-MFFFFFNN
% 0.48/300.19 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.48/300.19 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.48/300.19 # Preprocessing time : 0.001 s
% 0.48/300.19 # Presaturation interreduction done
% 0.48/300.19
% 0.48/300.19 # Proof found!
% 0.48/300.19 # SZS status Unsatisfiable
% 0.48/300.19 # SZS output start CNFRefutation
% See solution above
% 0.48/300.19 # Parsed axioms : 3
% 0.48/300.19 # Removed by relevancy pruning/SinE : 0
% 0.48/300.19 # Initial clauses : 3
% 0.48/300.19 # Removed in clause preprocessing : 0
% 0.48/300.19 # Initial clauses in saturation : 3
% 0.48/300.19 # Processed clauses : 61
% 0.48/300.19 # ...of these trivial : 11
% 0.48/300.19 # ...subsumed : 15
% 0.48/300.19 # ...remaining for further processing : 35
% 0.48/300.19 # Other redundant clauses eliminated : 0
% 0.48/300.19 # Clauses deleted for lack of memory : 0
% 0.48/300.19 # Backward-subsumed : 0
% 0.48/300.19 # Backward-rewritten : 20
% 0.48/300.19 # Generated clauses : 1576
% 0.48/300.19 # ...of the previous two non-redundant : 1321
% 0.48/300.19 # ...aggressively subsumed : 0
% 0.48/300.19 # Contextual simplify-reflections : 0
% 0.48/300.19 # Paramodulations : 1576
% 0.48/300.19 # Factorizations : 0
% 0.48/300.19 # NegExts : 0
% 0.48/300.19 # Equation resolutions : 0
% 0.48/300.19 # Total rewrite steps : 761
% 0.48/300.19 # Propositional unsat checks : 0
% 0.48/300.19 # Propositional check models : 0
% 0.48/300.19 # Propositional check unsatisfiable : 0
% 0.48/300.19 # Propositional clauses : 0
% 0.48/300.19 # Propositional clauses after purity: 0
% 0.48/300.19 # Propositional unsat core size : 0
% 0.48/300.19 # Propositional preprocessing time : 0.000
% 0.48/300.19 # Propositional encoding time : 0.000
% 0.48/300.19 # Propositional solver time : 0.000
% 0.48/300.19 # Success case prop preproc time : 0.000
% 0.48/300.19 # Success case prop encoding time : 0.000
% 0.48/300.19 # Success case prop solver time : 0.000
% 0.48/300.19 # Current number of processed clauses : 12
% 0.48/300.19 # Positive orientable unit clauses : 12
% 0.48/300.19 # Positive unorientable unit clauses: 0
% 0.48/300.19 # Negative unit clauses : 0
% 0.48/300.19 # Non-unit-clauses : 0
% 0.48/300.19 # Current number of unprocessed clauses: 1255
% 0.48/300.19 # ...number of literals in the above : 1255
% 0.48/300.19 # Current number of archived formulas : 0
% 0.48/300.19 # Current number of archived clauses : 23
% 0.48/300.19 # Clause-clause subsumption calls (NU) : 0
% 0.48/300.19 # Rec. Clause-clause subsumption calls : 0
% 0.48/300.19 # Non-unit clause-clause subsumptions : 0
% 0.48/300.19 # Unit Clause-clause subsumption calls : 3
% 0.48/300.19 # Rewrite failures with RHS unbound : 0
% 0.48/300.19 # BW rewrite match attempts : 118
% 0.48/300.19 # BW rewrite match successes : 31
% 0.48/300.19 # Condensation attempts : 0
% 0.48/300.19 # Condensation successes : 0
% 0.48/300.19 # Termbank termtop insertions : 26795
% 0.48/300.19
% 0.48/300.19 # -------------------------------------------------
% 0.48/300.19 # User time : 0.020 s
% 0.48/300.19 # System time : 0.003 s
% 0.48/300.19 # Total time : 0.023 s
% 0.48/300.19 # Maximum resident set size: 1604 pages
% 0.48/300.19
% 0.48/300.19 # -------------------------------------------------
% 0.48/300.19 # User time : 0.022 s
% 0.48/300.19 # System time : 0.004 s
% 0.48/300.19 # Total time : 0.027 s
% 0.48/300.19 # Maximum resident set size: 1672 pages
% 0.48/300.19 % E---3.1 exiting
%------------------------------------------------------------------------------