TSTP Solution File: GRP501-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP501-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:44 EDT 2023
% Result : Unsatisfiable 1.23s 0.61s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 3
% Syntax : Number of clauses : 47 ( 47 unt; 0 nHn; 3 RR)
% Number of literals : 47 ( 46 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 168 ( 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.smCWKex30n/E---3.1_27473.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.smCWKex30n/E---3.1_27473.p',multiply) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/tmp/tmp.smCWKex30n/E---3.1_27473.p',prove_these_axioms_3) ).
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,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_5,plain,
double_divide(inverse(X1),multiply(double_divide(X2,double_divide(X3,X2)),multiply(double_divide(X3,X4),X1))) = X4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
double_divide(inverse(X1),multiply(double_divide(X2,double_divide(inverse(X3),X2)),multiply(X4,X1))) = multiply(double_divide(X5,double_divide(X6,X5)),multiply(double_divide(X6,X4),X3)),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_7,plain,
double_divide(multiply(X1,X2),multiply(double_divide(X3,double_divide(X4,X3)),multiply(double_divide(X4,X5),double_divide(X2,X1)))) = X5,
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_8,plain,
multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X2,double_divide(inverse(X3),X4)),X3)) = X4,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
double_divide(multiply(X1,X2),double_divide(inverse(X3),multiply(double_divide(X4,double_divide(multiply(X1,X2),X4)),multiply(X5,X3)))) = X5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_6]),c_0_4]) ).
cnf(c_0_10,plain,
multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X2,double_divide(multiply(X3,X4),X5)),double_divide(X4,X3))) = X5,
inference(spm,[status(thm)],[c_0_8,c_0_4]) ).
cnf(c_0_11,plain,
double_divide(X1,double_divide(inverse(X2),multiply(double_divide(X3,double_divide(X1,X3)),multiply(X4,X2)))) = X4,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
multiply(multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X2,X3),X4)),inverse(X4)) = inverse(X3),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_13,plain,
multiply(double_divide(inverse(X1),multiply(double_divide(X2,double_divide(X3,X2)),multiply(X4,X1))),X3) = inverse(X4),
inference(spm,[status(thm)],[c_0_4,c_0_11]) ).
cnf(c_0_14,plain,
multiply(double_divide(X1,double_divide(X2,X1)),multiply(X3,X4)) = multiply(double_divide(X5,double_divide(X2,X5)),multiply(X3,X4)),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_15,plain,
multiply(multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X2,X3),double_divide(X4,X5))),multiply(X5,X4)) = inverse(X3),
inference(spm,[status(thm)],[c_0_12,c_0_4]) ).
cnf(c_0_16,plain,
multiply(double_divide(X1,X2),X2) = multiply(double_divide(X1,X3),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_13]),c_0_4]),c_0_4]) ).
cnf(c_0_17,plain,
multiply(multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X2,X3),X3)),multiply(X4,X5)) = multiply(X4,X5),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_4]) ).
cnf(c_0_18,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_11,c_0_14]),c_0_11]) ).
cnf(c_0_19,plain,
multiply(multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X2,X3),X3)),X4) = X4,
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_20,plain,
multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X2,double_divide(X3,double_divide(X4,X3))),X5)) = double_divide(X4,inverse(X5)),
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_21,plain,
multiply(double_divide(X1,multiply(double_divide(X1,X2),X2)),X3) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_4]) ).
cnf(c_0_22,plain,
double_divide(inverse(X1),multiply(double_divide(X2,double_divide(X3,X2)),X1)) = multiply(double_divide(X3,X4),X4),
inference(spm,[status(thm)],[c_0_5,c_0_21]) ).
cnf(c_0_23,plain,
multiply(double_divide(X1,double_divide(X2,X1)),double_divide(X2,X3)) = multiply(double_divide(X3,X4),X4),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_24,plain,
double_divide(multiply(X1,X2),multiply(double_divide(X1,X3),X3)) = multiply(double_divide(X2,X4),X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_4]) ).
cnf(c_0_25,plain,
multiply(double_divide(multiply(X1,X2),multiply(multiply(double_divide(X2,X3),X3),multiply(double_divide(X1,X4),X4))),X5) = X5,
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_26,plain,
inverse(multiply(double_divide(X1,X2),X2)) = multiply(multiply(double_divide(X3,X4),X4),multiply(X3,X1)),
inference(spm,[status(thm)],[c_0_4,c_0_24]) ).
cnf(c_0_27,plain,
multiply(double_divide(multiply(X1,double_divide(X1,X2)),inverse(multiply(double_divide(X2,X3),X3))),X4) = X4,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
double_divide(multiply(X1,X2),multiply(double_divide(X3,double_divide(X4,X3)),multiply(double_divide(X4,X5),X5))) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
cnf(c_0_29,plain,
inverse(multiply(double_divide(X1,X2),X2)) = multiply(double_divide(multiply(X3,double_divide(X3,X1)),X4),X4),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_30,plain,
double_divide(inverse(X1),multiply(double_divide(X2,double_divide(X3,X2)),multiply(double_divide(X3,X4),X4))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_16]) ).
cnf(c_0_31,plain,
multiply(double_divide(X1,X2),X2) = double_divide(X3,double_divide(multiply(X4,double_divide(X4,X1)),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_32,plain,
double_divide(multiply(X1,X2),multiply(double_divide(X3,double_divide(X4,X3)),multiply(double_divide(X1,X5),X5))) = double_divide(X2,X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_23]),c_0_4]) ).
cnf(c_0_33,plain,
multiply(double_divide(X1,multiply(X2,double_divide(X2,X1))),X3) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_31]),c_0_32]) ).
cnf(c_0_34,plain,
multiply(X1,double_divide(X1,X2)) = multiply(double_divide(X2,X3),X3),
inference(spm,[status(thm)],[c_0_16,c_0_33]) ).
cnf(c_0_35,plain,
multiply(multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X3,X4),X4)),multiply(X3,X5)) = multiply(X2,X5),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_23]),c_0_4]),c_0_4]) ).
cnf(c_0_36,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_34]),c_0_4]),c_0_32]) ).
cnf(c_0_37,plain,
multiply(X1,double_divide(X1,X2)) = inverse(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_34]),c_0_4]),c_0_35]) ).
cnf(c_0_38,plain,
multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X3,double_divide(inverse(X4),X3)),X4)) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_39,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_36,c_0_36]) ).
cnf(c_0_40,plain,
double_divide(X1,double_divide(inverse(X2),X1)) = inverse(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_34]),c_0_37]),c_0_37]) ).
cnf(c_0_41,plain,
multiply(X1,multiply(inverse(X2),X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_42,plain,
multiply(multiply(X1,inverse(X2)),X2) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_41]),c_0_39]),c_0_34]),c_0_37]),c_0_41]) ).
cnf(c_0_43,plain,
multiply(multiply(double_divide(X1,double_divide(X2,X1)),multiply(double_divide(X3,double_divide(X4,X3)),X5)),inverse(X5)) = multiply(X2,X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_18]),c_0_4]) ).
cnf(c_0_44,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_45,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_39]),c_0_39]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : GRP501-1 : TPTP v8.1.2. Released v2.6.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n017.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 02:09:56 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.smCWKex30n/E---3.1_27473.p
% 1.23/0.61 # Version: 3.1pre001
% 1.23/0.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.23/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.23/0.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.23/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.23/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.23/0.61 # Starting sh5l with 300s (1) cores
% 1.23/0.61 # new_bool_3 with pid 27551 completed with status 0
% 1.23/0.61 # Result found by new_bool_3
% 1.23/0.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.23/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.23/0.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.23/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.23/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.23/0.61 # Search class: FUUPS-FFSF21-DFFFFFNN
% 1.23/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.23/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.23/0.61 # SAT001_MinMin_p005000_rr_RG with pid 27555 completed with status 0
% 1.23/0.61 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.23/0.61 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.23/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.23/0.61 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.23/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.23/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.23/0.61 # Search class: FUUPS-FFSF21-DFFFFFNN
% 1.23/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.23/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.23/0.61 # Preprocessing time : 0.001 s
% 1.23/0.61 # Presaturation interreduction done
% 1.23/0.61
% 1.23/0.61 # Proof found!
% 1.23/0.61 # SZS status Unsatisfiable
% 1.23/0.61 # SZS output start CNFRefutation
% See solution above
% 1.23/0.61 # Parsed axioms : 3
% 1.23/0.61 # Removed by relevancy pruning/SinE : 0
% 1.23/0.61 # Initial clauses : 3
% 1.23/0.61 # Removed in clause preprocessing : 0
% 1.23/0.61 # Initial clauses in saturation : 3
% 1.23/0.61 # Processed clauses : 398
% 1.23/0.61 # ...of these trivial : 64
% 1.23/0.61 # ...subsumed : 241
% 1.23/0.61 # ...remaining for further processing : 93
% 1.23/0.61 # Other redundant clauses eliminated : 0
% 1.23/0.61 # Clauses deleted for lack of memory : 0
% 1.23/0.61 # Backward-subsumed : 1
% 1.23/0.61 # Backward-rewritten : 57
% 1.23/0.61 # Generated clauses : 13476
% 1.23/0.61 # ...of the previous two non-redundant : 12457
% 1.23/0.61 # ...aggressively subsumed : 0
% 1.23/0.61 # Contextual simplify-reflections : 0
% 1.23/0.61 # Paramodulations : 13476
% 1.23/0.61 # Factorizations : 0
% 1.23/0.61 # NegExts : 0
% 1.23/0.61 # Equation resolutions : 0
% 1.23/0.61 # Total rewrite steps : 5901
% 1.23/0.61 # Propositional unsat checks : 0
% 1.23/0.61 # Propositional check models : 0
% 1.23/0.61 # Propositional check unsatisfiable : 0
% 1.23/0.61 # Propositional clauses : 0
% 1.23/0.61 # Propositional clauses after purity: 0
% 1.23/0.61 # Propositional unsat core size : 0
% 1.23/0.61 # Propositional preprocessing time : 0.000
% 1.23/0.61 # Propositional encoding time : 0.000
% 1.23/0.61 # Propositional solver time : 0.000
% 1.23/0.61 # Success case prop preproc time : 0.000
% 1.23/0.61 # Success case prop encoding time : 0.000
% 1.23/0.61 # Success case prop solver time : 0.000
% 1.23/0.61 # Current number of processed clauses : 32
% 1.23/0.61 # Positive orientable unit clauses : 30
% 1.23/0.61 # Positive unorientable unit clauses: 2
% 1.23/0.61 # Negative unit clauses : 0
% 1.23/0.61 # Non-unit-clauses : 0
% 1.23/0.61 # Current number of unprocessed clauses: 11936
% 1.23/0.61 # ...number of literals in the above : 11936
% 1.23/0.61 # Current number of archived formulas : 0
% 1.23/0.61 # Current number of archived clauses : 61
% 1.23/0.61 # Clause-clause subsumption calls (NU) : 0
% 1.23/0.61 # Rec. Clause-clause subsumption calls : 0
% 1.23/0.61 # Non-unit clause-clause subsumptions : 0
% 1.23/0.61 # Unit Clause-clause subsumption calls : 347
% 1.23/0.61 # Rewrite failures with RHS unbound : 0
% 1.23/0.61 # BW rewrite match attempts : 896
% 1.23/0.61 # BW rewrite match successes : 139
% 1.23/0.61 # Condensation attempts : 0
% 1.23/0.61 # Condensation successes : 0
% 1.23/0.61 # Termbank termtop insertions : 254435
% 1.23/0.61
% 1.23/0.61 # -------------------------------------------------
% 1.23/0.61 # User time : 0.182 s
% 1.23/0.61 # System time : 0.011 s
% 1.23/0.61 # Total time : 0.193 s
% 1.23/0.61 # Maximum resident set size: 1612 pages
% 1.23/0.61
% 1.23/0.61 # -------------------------------------------------
% 1.23/0.61 # User time : 0.182 s
% 1.23/0.61 # System time : 0.014 s
% 1.23/0.61 # Total time : 0.196 s
% 1.23/0.61 # Maximum resident set size: 1672 pages
% 1.23/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------