TSTP Solution File: GRP535-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP535-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %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 : 300s
% WCLimit : 300s
% DateTime : Fri May 3 02:22:51 EDT 2024
% Result : Unsatisfiable 3.72s 1.19s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(divide(X0,divide(divide(X0,X1),X2)),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,divide(divide(X1,X1),X2)) = multiply(X0,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,plain,
divide(divide(X0,X0),X1) = inverse(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(c_52,plain,
divide(X0,X0) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(c_53,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_68,plain,
divide(identity,X0) = inverse(X0),
inference(light_normalisation,[status(thm)],[c_51,c_52]) ).
cnf(c_69,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_50,c_52,c_68]) ).
cnf(c_76,plain,
multiply(a3,b3) = sP0_iProver_def,
definition ).
cnf(c_77,plain,
multiply(sP0_iProver_def,c3) = sP1_iProver_def,
definition ).
cnf(c_78,plain,
multiply(b3,c3) = sP2_iProver_def,
definition ).
cnf(c_79,plain,
multiply(a3,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_80,negated_conjecture,
sP1_iProver_def != sP3_iProver_def,
inference(demodulation,[status(thm)],[c_53,c_78,c_79,c_76,c_77]) ).
cnf(c_131,plain,
multiply(inverse(X0),X0) = identity,
inference(superposition,[status(thm)],[c_69,c_52]) ).
cnf(c_132,plain,
multiply(identity,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_69,c_68]) ).
cnf(c_139,plain,
divide(divide(X0,identity),X1) = divide(X0,X1),
inference(superposition,[status(thm)],[c_52,c_49]) ).
cnf(c_140,plain,
divide(divide(X0,multiply(divide(X0,X1),X2)),X1) = inverse(X2),
inference(superposition,[status(thm)],[c_69,c_49]) ).
cnf(c_142,plain,
divide(divide(X0,divide(identity,X1)),X0) = X1,
inference(superposition,[status(thm)],[c_52,c_49]) ).
cnf(c_146,plain,
divide(divide(X0,X1),divide(divide(X0,X2),X1)) = X2,
inference(superposition,[status(thm)],[c_49,c_49]) ).
cnf(c_190,plain,
multiply(divide(X0,identity),X1) = divide(X0,inverse(X1)),
inference(superposition,[status(thm)],[c_139,c_69]) ).
cnf(c_192,plain,
multiply(divide(X0,identity),X1) = multiply(X0,X1),
inference(light_normalisation,[status(thm)],[c_190,c_69]) ).
cnf(c_232,plain,
divide(multiply(X0,X1),X0) = X1,
inference(demodulation,[status(thm)],[c_142,c_68,c_69]) ).
cnf(c_234,plain,
divide(sP0_iProver_def,a3) = b3,
inference(superposition,[status(thm)],[c_76,c_232]) ).
cnf(c_235,plain,
divide(sP2_iProver_def,b3) = c3,
inference(superposition,[status(thm)],[c_78,c_232]) ).
cnf(c_236,plain,
divide(sP1_iProver_def,sP0_iProver_def) = c3,
inference(superposition,[status(thm)],[c_77,c_232]) ).
cnf(c_237,plain,
divide(sP3_iProver_def,a3) = sP2_iProver_def,
inference(superposition,[status(thm)],[c_79,c_232]) ).
cnf(c_238,plain,
divide(identity,inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_131,c_232]) ).
cnf(c_242,plain,
multiply(multiply(inverse(X0),X1),X0) = X1,
inference(superposition,[status(thm)],[c_232,c_69]) ).
cnf(c_300,plain,
multiply(identity,X0) = X0,
inference(demodulation,[status(thm)],[c_238,c_68,c_132]) ).
cnf(c_302,plain,
inverse(inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_132,c_300]) ).
cnf(c_306,plain,
divide(X0,identity) = X0,
inference(superposition,[status(thm)],[c_300,c_232]) ).
cnf(c_419,plain,
multiply(X0,inverse(X1)) = divide(X0,X1),
inference(superposition,[status(thm)],[c_302,c_69]) ).
cnf(c_431,plain,
divide(X0,divide(divide(X0,identity),X1)) = X1,
inference(superposition,[status(thm)],[c_306,c_49]) ).
cnf(c_433,plain,
divide(X0,multiply(divide(X0,identity),X1)) = inverse(X1),
inference(superposition,[status(thm)],[c_306,c_140]) ).
cnf(c_440,plain,
divide(X0,divide(X0,X1)) = X1,
inference(light_normalisation,[status(thm)],[c_431,c_306]) ).
cnf(c_442,plain,
divide(X0,multiply(X0,X1)) = inverse(X1),
inference(light_normalisation,[status(thm)],[c_433,c_192]) ).
cnf(c_470,plain,
divide(multiply(X0,X1),X1) = X0,
inference(superposition,[status(thm)],[c_232,c_440]) ).
cnf(c_474,plain,
divide(sP3_iProver_def,sP2_iProver_def) = a3,
inference(superposition,[status(thm)],[c_237,c_440]) ).
cnf(c_523,plain,
multiply(inverse(X0),X1) = divide(X1,X0),
inference(superposition,[status(thm)],[c_242,c_470]) ).
cnf(c_578,plain,
divide(divide(X0,X1),inverse(X1)) = X0,
inference(superposition,[status(thm)],[c_419,c_470]) ).
cnf(c_579,plain,
divide(divide(X0,X1),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_419,c_232]) ).
cnf(c_612,plain,
divide(X0,inverse(X1)) = multiply(X1,X0),
inference(superposition,[status(thm)],[c_302,c_523]) ).
cnf(c_620,plain,
multiply(X0,divide(X1,X0)) = X1,
inference(demodulation,[status(thm)],[c_578,c_612]) ).
cnf(c_637,plain,
multiply(sP2_iProver_def,a3) = sP3_iProver_def,
inference(superposition,[status(thm)],[c_474,c_620]) ).
cnf(c_666,plain,
divide(sP2_iProver_def,sP3_iProver_def) = inverse(a3),
inference(superposition,[status(thm)],[c_637,c_442]) ).
cnf(c_702,plain,
divide(b3,sP0_iProver_def) = inverse(a3),
inference(superposition,[status(thm)],[c_234,c_579]) ).
cnf(c_704,plain,
divide(c3,sP1_iProver_def) = inverse(sP0_iProver_def),
inference(superposition,[status(thm)],[c_236,c_579]) ).
cnf(c_727,plain,
divide(inverse(a3),b3) = inverse(sP0_iProver_def),
inference(superposition,[status(thm)],[c_702,c_579]) ).
cnf(c_751,plain,
divide(c3,inverse(sP0_iProver_def)) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_704,c_440]) ).
cnf(c_784,plain,
divide(c3,divide(divide(sP2_iProver_def,X0),b3)) = X0,
inference(superposition,[status(thm)],[c_235,c_146]) ).
cnf(c_1439,plain,
divide(c3,divide(inverse(a3),b3)) = sP3_iProver_def,
inference(superposition,[status(thm)],[c_666,c_784]) ).
cnf(c_1445,plain,
sP1_iProver_def = sP3_iProver_def,
inference(light_normalisation,[status(thm)],[c_1439,c_727,c_751]) ).
cnf(c_1446,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1445,c_80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP535-1 : TPTP v8.1.2. Released v2.6.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 23:51:46 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running UEQ theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.72/1.19 % SZS status Started for theBenchmark.p
% 3.72/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.72/1.19
% 3.72/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.72/1.19
% 3.72/1.19 ------ iProver source info
% 3.72/1.19
% 3.72/1.19 git: date: 2024-05-02 19:28:25 +0000
% 3.72/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.72/1.19 git: non_committed_changes: false
% 3.72/1.19
% 3.72/1.19 ------ Parsing...successful
% 3.72/1.19
% 3.72/1.19
% 3.72/1.19
% 3.72/1.19 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.72/1.19
% 3.72/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.72/1.19
% 3.72/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.72/1.19 ------ Proving...
% 3.72/1.19 ------ Problem Properties
% 3.72/1.19
% 3.72/1.19
% 3.72/1.19 clauses 9
% 3.72/1.19 conjectures 1
% 3.72/1.19 EPR 1
% 3.72/1.19 Horn 9
% 3.72/1.19 unary 9
% 3.72/1.19 binary 0
% 3.72/1.19 lits 9
% 3.72/1.19 lits eq 9
% 3.72/1.19 fd_pure 0
% 3.72/1.19 fd_pseudo 0
% 3.72/1.19 fd_cond 0
% 3.72/1.19 fd_pseudo_cond 0
% 3.72/1.19 AC symbols 0
% 3.72/1.19
% 3.72/1.19 ------ Input Options Time Limit: Unbounded
% 3.72/1.19
% 3.72/1.19
% 3.72/1.19 ------
% 3.72/1.19 Current options:
% 3.72/1.19 ------
% 3.72/1.19
% 3.72/1.19
% 3.72/1.19
% 3.72/1.19
% 3.72/1.19 ------ Proving...
% 3.72/1.19
% 3.72/1.19
% 3.72/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.72/1.19
% 3.72/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.72/1.19
% 3.72/1.19
%------------------------------------------------------------------------------