TSTP Solution File: GRP536-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP536-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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.60s 1.20s
% Output : CNFRefutation 3.60s
% 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/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,divide(divide(X1,X1),X2)) = multiply(X0,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,plain,
divide(divide(X0,X0),X1) = inverse(X1),
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(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(a,b) = sP0_iProver_def,
definition ).
cnf(c_77,plain,
multiply(b,a) = sP1_iProver_def,
definition ).
cnf(c_78,negated_conjecture,
sP0_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_53,c_77,c_76]) ).
cnf(c_125,plain,
multiply(inverse(X0),X0) = identity,
inference(superposition,[status(thm)],[c_69,c_52]) ).
cnf(c_126,plain,
multiply(identity,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_69,c_68]) ).
cnf(c_138,plain,
divide(divide(X0,multiply(divide(X0,X1),X2)),X1) = inverse(X2),
inference(superposition,[status(thm)],[c_69,c_49]) ).
cnf(c_140,plain,
divide(divide(X0,divide(identity,X1)),X0) = X1,
inference(superposition,[status(thm)],[c_52,c_49]) ).
cnf(c_162,plain,
divide(X0,multiply(identity,X1)) = multiply(X0,inverse(X1)),
inference(superposition,[status(thm)],[c_126,c_69]) ).
cnf(c_229,plain,
divide(multiply(X0,X1),X0) = X1,
inference(demodulation,[status(thm)],[c_140,c_68,c_69]) ).
cnf(c_231,plain,
divide(sP0_iProver_def,a) = b,
inference(superposition,[status(thm)],[c_76,c_229]) ).
cnf(c_233,plain,
divide(identity,inverse(X0)) = X0,
inference(superposition,[status(thm)],[c_125,c_229]) ).
cnf(c_288,plain,
multiply(identity,X0) = X0,
inference(demodulation,[status(thm)],[c_233,c_68,c_126]) ).
cnf(c_290,plain,
inverse(inverse(X0)) = X0,
inference(demodulation,[status(thm)],[c_126,c_288]) ).
cnf(c_302,plain,
multiply(X0,inverse(X1)) = divide(X0,X1),
inference(superposition,[status(thm)],[c_290,c_69]) ).
cnf(c_323,plain,
divide(divide(X0,multiply(identity,X1)),X0) = inverse(X1),
inference(superposition,[status(thm)],[c_52,c_138]) ).
cnf(c_337,plain,
divide(divide(X0,X1),X0) = inverse(X1),
inference(light_normalisation,[status(thm)],[c_323,c_162,c_302]) ).
cnf(c_428,plain,
divide(b,sP0_iProver_def) = inverse(a),
inference(superposition,[status(thm)],[c_231,c_337]) ).
cnf(c_434,plain,
divide(divide(X0,inverse(X1)),X1) = X0,
inference(superposition,[status(thm)],[c_337,c_49]) ).
cnf(c_442,plain,
divide(multiply(X0,X1),X1) = X0,
inference(light_normalisation,[status(thm)],[c_434,c_69]) ).
cnf(c_483,plain,
divide(sP1_iProver_def,a) = b,
inference(superposition,[status(thm)],[c_77,c_442]) ).
cnf(c_522,plain,
divide(b,sP1_iProver_def) = inverse(a),
inference(superposition,[status(thm)],[c_483,c_337]) ).
cnf(c_527,plain,
divide(inverse(a),b) = inverse(sP0_iProver_def),
inference(superposition,[status(thm)],[c_428,c_337]) ).
cnf(c_565,plain,
divide(inverse(a),b) = inverse(sP1_iProver_def),
inference(superposition,[status(thm)],[c_522,c_337]) ).
cnf(c_568,plain,
inverse(sP0_iProver_def) = inverse(sP1_iProver_def),
inference(light_normalisation,[status(thm)],[c_565,c_527]) ).
cnf(c_576,plain,
inverse(inverse(sP0_iProver_def)) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_568,c_290]) ).
cnf(c_615,plain,
sP0_iProver_def = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_576,c_290]) ).
cnf(c_616,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_615,c_78]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP536-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 23:39:48 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running UEQ theorem proving
% 0.21/0.48 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.60/1.20 % SZS status Started for theBenchmark.p
% 3.60/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 3.60/1.20
% 3.60/1.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.60/1.20
% 3.60/1.20 ------ iProver source info
% 3.60/1.20
% 3.60/1.20 git: date: 2024-05-02 19:28:25 +0000
% 3.60/1.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.60/1.20 git: non_committed_changes: false
% 3.60/1.20
% 3.60/1.20 ------ Parsing...successful
% 3.60/1.20
% 3.60/1.20
% 3.60/1.20
% 3.60/1.20 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.60/1.20
% 3.60/1.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.60/1.20
% 3.60/1.20 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.60/1.20 ------ Proving...
% 3.60/1.20 ------ Problem Properties
% 3.60/1.20
% 3.60/1.20
% 3.60/1.20 clauses 7
% 3.60/1.20 conjectures 1
% 3.60/1.20 EPR 1
% 3.60/1.20 Horn 7
% 3.60/1.20 unary 7
% 3.60/1.20 binary 0
% 3.60/1.20 lits 7
% 3.60/1.20 lits eq 7
% 3.60/1.20 fd_pure 0
% 3.60/1.20 fd_pseudo 0
% 3.60/1.20 fd_cond 0
% 3.60/1.20 fd_pseudo_cond 0
% 3.60/1.20 AC symbols 0
% 3.60/1.20
% 3.60/1.20 ------ Input Options Time Limit: Unbounded
% 3.60/1.20
% 3.60/1.20
% 3.60/1.20 ------
% 3.60/1.20 Current options:
% 3.60/1.20 ------
% 3.60/1.20
% 3.60/1.20
% 3.60/1.20
% 3.60/1.20
% 3.60/1.20 ------ Proving...
% 3.60/1.20
% 3.60/1.20
% 3.60/1.20 % SZS status Unsatisfiable for theBenchmark.p
% 3.60/1.20
% 3.60/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.60/1.20
% 3.60/1.20
%------------------------------------------------------------------------------