TSTP Solution File: GRP525-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP525-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:50 EDT 2024
% Result : Unsatisfiable 2.19s 1.19s
% Output : CNFRefutation 2.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(X0,divide(divide(X0,X1),divide(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,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(c_64,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
inference(demodulation,[status(thm)],[c_50,c_51]) ).
cnf(c_71,plain,
inverse(a1) = sP0_iProver_def,
definition ).
cnf(c_72,plain,
multiply(sP0_iProver_def,a1) = sP1_iProver_def,
definition ).
cnf(c_73,plain,
inverse(b1) = sP2_iProver_def,
definition ).
cnf(c_74,plain,
multiply(sP2_iProver_def,b1) = sP3_iProver_def,
definition ).
cnf(c_75,negated_conjecture,
sP1_iProver_def != sP3_iProver_def,
inference(demodulation,[status(thm)],[c_52,c_73,c_74,c_71,c_72]) ).
cnf(c_129,plain,
divide(X0,sP0_iProver_def) = multiply(X0,a1),
inference(superposition,[status(thm)],[c_71,c_64]) ).
cnf(c_130,plain,
divide(X0,sP2_iProver_def) = multiply(X0,b1),
inference(superposition,[status(thm)],[c_73,c_64]) ).
cnf(c_133,plain,
divide(sP0_iProver_def,sP0_iProver_def) = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_72,c_129]) ).
cnf(c_134,plain,
divide(sP2_iProver_def,sP2_iProver_def) = sP3_iProver_def,
inference(demodulation,[status(thm)],[c_74,c_130]) ).
cnf(c_139,plain,
divide(sP1_iProver_def,X0) = inverse(X0),
inference(superposition,[status(thm)],[c_133,c_51]) ).
cnf(c_213,plain,
divide(sP3_iProver_def,X0) = inverse(X0),
inference(superposition,[status(thm)],[c_134,c_51]) ).
cnf(c_221,plain,
divide(X0,divide(divide(X0,X1),inverse(X1))) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_139,c_49]) ).
cnf(c_244,plain,
divide(X0,divide(divide(X0,X1),inverse(X1))) = sP3_iProver_def,
inference(superposition,[status(thm)],[c_213,c_49]) ).
cnf(c_252,plain,
sP1_iProver_def = sP3_iProver_def,
inference(light_normalisation,[status(thm)],[c_244,c_221]) ).
cnf(c_253,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_252,c_75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP525-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 23:47:18 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running UEQ theorem proving
% 0.20/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
% 2.19/1.19 % SZS status Started for theBenchmark.p
% 2.19/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 2.19/1.19
% 2.19/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.19/1.19
% 2.19/1.19 ------ iProver source info
% 2.19/1.19
% 2.19/1.19 git: date: 2024-05-02 19:28:25 +0000
% 2.19/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.19/1.19 git: non_committed_changes: false
% 2.19/1.19
% 2.19/1.19 ------ Parsing...successful
% 2.19/1.19
% 2.19/1.19
% 2.19/1.19
% 2.19/1.19 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.19/1.19
% 2.19/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.19/1.19
% 2.19/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.19/1.19 ------ Proving...
% 2.19/1.19 ------ Problem Properties
% 2.19/1.19
% 2.19/1.19
% 2.19/1.19 clauses 8
% 2.19/1.19 conjectures 1
% 2.19/1.19 EPR 1
% 2.19/1.19 Horn 8
% 2.19/1.19 unary 8
% 2.19/1.19 binary 0
% 2.19/1.19 lits 8
% 2.19/1.19 lits eq 8
% 2.19/1.19 fd_pure 0
% 2.19/1.19 fd_pseudo 0
% 2.19/1.19 fd_cond 0
% 2.19/1.19 fd_pseudo_cond 0
% 2.19/1.19 AC symbols 0
% 2.19/1.19
% 2.19/1.19 ------ Input Options Time Limit: Unbounded
% 2.19/1.19
% 2.19/1.19
% 2.19/1.19 ------
% 2.19/1.19 Current options:
% 2.19/1.19 ------
% 2.19/1.19
% 2.19/1.19
% 2.19/1.19
% 2.19/1.19
% 2.19/1.19 ------ Proving...
% 2.19/1.19
% 2.19/1.19
% 2.19/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 2.19/1.19
% 2.19/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.19/1.19
% 2.19/1.19
%------------------------------------------------------------------------------