TSTP Solution File: GRP544-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP544-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:52 EDT 2024
% Result : Unsatisfiable 3.50s 1.64s
% Output : CNFRefutation 3.50s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(divide(identity,divide(divide(divide(X0,X1),X2),X0)),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,divide(identity,X1)) = multiply(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,plain,
divide(identity,X0) = inverse(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(c_52,plain,
divide(X0,X0) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
cnf(c_53,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).
cnf(c_68,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_50,c_51]) ).
cnf(c_69,plain,
divide(inverse(divide(divide(divide(X0,X1),X2),X0)),X2) = X1,
inference(demodulation,[status(thm)],[c_49,c_51]) ).
cnf(c_77,plain,
multiply(a,b) = sP0_iProver_def,
definition ).
cnf(c_78,plain,
multiply(b,a) = sP1_iProver_def,
definition ).
cnf(c_79,negated_conjecture,
sP0_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_53,c_78,c_77]) ).
cnf(c_127,plain,
inverse(identity) = identity,
inference(superposition,[status(thm)],[c_52,c_51]) ).
cnf(c_132,plain,
multiply(identity,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_68,c_51]) ).
cnf(c_133,plain,
multiply(inverse(X0),X0) = identity,
inference(superposition,[status(thm)],[c_68,c_52]) ).
cnf(c_137,plain,
multiply(identity,identity) = identity,
inference(superposition,[status(thm)],[c_127,c_133]) ).
cnf(c_143,plain,
divide(inverse(divide(identity,X0)),divide(X0,X1)) = X1,
inference(superposition,[status(thm)],[c_52,c_69]) ).
cnf(c_146,plain,
divide(inverse(divide(divide(identity,X0),X1)),X0) = X1,
inference(superposition,[status(thm)],[c_52,c_69]) ).
cnf(c_151,plain,
divide(inverse(divide(inverse(X0),X1)),X0) = X1,
inference(light_normalisation,[status(thm)],[c_146,c_51]) ).
cnf(c_152,plain,
divide(multiply(identity,X0),divide(X0,X1)) = X1,
inference(light_normalisation,[status(thm)],[c_143,c_51,c_132]) ).
cnf(c_178,plain,
divide(inverse(X0),divide(inverse(X1),X0)) = X1,
inference(superposition,[status(thm)],[c_151,c_151]) ).
cnf(c_210,plain,
divide(multiply(identity,identity),inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_51,c_152]) ).
cnf(c_218,plain,
divide(identity,inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_210,c_137]) ).
cnf(c_230,plain,
multiply(identity,X0) = X0,
inference(demodulation,[status(thm)],[c_218,c_51,c_132]) ).
cnf(c_231,plain,
divide(X0,divide(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_152,c_230]) ).
cnf(c_232,plain,
inverse(inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_132,c_230]) ).
cnf(c_287,plain,
divide(X0,multiply(X0,X1)) = inverse(X1),
inference(superposition,[status(thm)],[c_68,c_231]) ).
cnf(c_329,plain,
divide(a,sP0_iProver_def) = inverse(b),
inference(superposition,[status(thm)],[c_77,c_287]) ).
cnf(c_341,plain,
divide(a,inverse(b)) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_329,c_231]) ).
cnf(c_418,plain,
divide(inverse(inverse(X0)),multiply(inverse(X1),X0)) = X1,
inference(superposition,[status(thm)],[c_68,c_178]) ).
cnf(c_430,plain,
divide(X0,multiply(inverse(X1),X0)) = X1,
inference(light_normalisation,[status(thm)],[c_418,c_232]) ).
cnf(c_443,plain,
divide(X0,multiply(X1,X0)) = inverse(X1),
inference(superposition,[status(thm)],[c_232,c_430]) ).
cnf(c_454,plain,
divide(a,sP1_iProver_def) = inverse(b),
inference(superposition,[status(thm)],[c_78,c_443]) ).
cnf(c_464,plain,
divide(a,inverse(b)) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_454,c_231]) ).
cnf(c_465,plain,
sP0_iProver_def = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_464,c_341]) ).
cnf(c_466,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_465,c_79]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP544-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.10/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 00:06:51 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.47 Running UEQ theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.50/1.64 % SZS status Started for theBenchmark.p
% 3.50/1.64 % SZS status Unsatisfiable for theBenchmark.p
% 3.50/1.64
% 3.50/1.64 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.50/1.64
% 3.50/1.64 ------ iProver source info
% 3.50/1.64
% 3.50/1.64 git: date: 2024-05-02 19:28:25 +0000
% 3.50/1.64 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.50/1.64 git: non_committed_changes: false
% 3.50/1.64
% 3.50/1.64 ------ Parsing...successful
% 3.50/1.64
% 3.50/1.64
% 3.50/1.64
% 3.50/1.64 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.50/1.64
% 3.50/1.64 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.50/1.64
% 3.50/1.64 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.50/1.64 ------ Proving...
% 3.50/1.64 ------ Problem Properties
% 3.50/1.64
% 3.50/1.64
% 3.50/1.64 clauses 7
% 3.50/1.64 conjectures 1
% 3.50/1.64 EPR 1
% 3.50/1.64 Horn 7
% 3.50/1.64 unary 7
% 3.50/1.64 binary 0
% 3.50/1.64 lits 7
% 3.50/1.64 lits eq 7
% 3.50/1.64 fd_pure 0
% 3.50/1.64 fd_pseudo 0
% 3.50/1.64 fd_cond 0
% 3.50/1.64 fd_pseudo_cond 0
% 3.50/1.64 AC symbols 0
% 3.50/1.64
% 3.50/1.64 ------ Input Options Time Limit: Unbounded
% 3.50/1.64
% 3.50/1.64
% 3.50/1.64 ------
% 3.50/1.64 Current options:
% 3.50/1.64 ------
% 3.50/1.64
% 3.50/1.64
% 3.50/1.64
% 3.50/1.64
% 3.50/1.64 ------ Proving...
% 3.50/1.64
% 3.50/1.64
% 3.50/1.64 % SZS status Unsatisfiable for theBenchmark.p
% 3.50/1.64
% 3.50/1.64 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.50/1.64
% 3.50/1.64
%------------------------------------------------------------------------------