TSTP Solution File: GRP558-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP558-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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:55 EDT 2024
% Result : Unsatisfiable 3.61s 1.16s
% Output : CNFRefutation 3.61s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(X0,inverse(divide(divide(X1,X2),divide(X0,X2)))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_50,plain,
divide(X0,inverse(X1)) = multiply(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_51,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_60,plain,
multiply(X0,divide(divide(X1,X2),divide(X0,X2))) = X1,
inference(demodulation,[status(thm)],[c_49,c_50]) ).
cnf(c_67,plain,
inverse(b2) = sP0_iProver_def,
definition ).
cnf(c_68,plain,
multiply(sP0_iProver_def,b2) = sP1_iProver_def,
definition ).
cnf(c_69,plain,
multiply(sP1_iProver_def,a2) = sP2_iProver_def,
definition ).
cnf(c_70,negated_conjecture,
sP2_iProver_def != a2,
inference(demodulation,[status(thm)],[c_51,c_67,c_68,c_69]) ).
cnf(c_116,plain,
divide(X0,sP0_iProver_def) = multiply(X0,b2),
inference(superposition,[status(thm)],[c_67,c_50]) ).
cnf(c_117,plain,
divide(sP0_iProver_def,sP0_iProver_def) = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_68,c_116]) ).
cnf(c_119,plain,
multiply(X0,divide(multiply(X1,X2),divide(X0,inverse(X2)))) = X1,
inference(superposition,[status(thm)],[c_50,c_60]) ).
cnf(c_120,plain,
multiply(X0,divide(sP1_iProver_def,divide(X0,sP0_iProver_def))) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_117,c_60]) ).
cnf(c_127,plain,
multiply(X0,divide(multiply(X1,X2),multiply(X0,X2))) = X1,
inference(demodulation,[status(thm)],[c_119,c_50]) ).
cnf(c_128,plain,
multiply(X0,divide(X1,multiply(X0,divide(divide(X1,X2),divide(X3,X2))))) = X3,
inference(superposition,[status(thm)],[c_60,c_127]) ).
cnf(c_146,plain,
multiply(sP0_iProver_def,divide(sP1_iProver_def,sP1_iProver_def)) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_117,c_120]) ).
cnf(c_175,plain,
multiply(sP0_iProver_def,divide(multiply(X0,divide(sP1_iProver_def,sP1_iProver_def)),sP0_iProver_def)) = X0,
inference(superposition,[status(thm)],[c_146,c_127]) ).
cnf(c_218,plain,
multiply(sP0_iProver_def,divide(sP0_iProver_def,sP0_iProver_def)) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_146,c_175]) ).
cnf(c_222,plain,
multiply(sP0_iProver_def,sP1_iProver_def) = sP0_iProver_def,
inference(light_normalisation,[status(thm)],[c_218,c_117]) ).
cnf(c_236,plain,
multiply(sP0_iProver_def,divide(multiply(X0,sP1_iProver_def),sP0_iProver_def)) = X0,
inference(superposition,[status(thm)],[c_222,c_127]) ).
cnf(c_292,plain,
multiply(X0,divide(X1,X1)) = X0,
inference(superposition,[status(thm)],[c_60,c_128]) ).
cnf(c_300,plain,
multiply(sP0_iProver_def,divide(X0,sP0_iProver_def)) = X0,
inference(demodulation,[status(thm)],[c_175,c_292]) ).
cnf(c_303,plain,
multiply(X0,sP1_iProver_def) = X0,
inference(demodulation,[status(thm)],[c_236,c_300]) ).
cnf(c_319,plain,
multiply(X0,divide(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_292,c_128]) ).
cnf(c_363,plain,
multiply(inverse(X0),multiply(X1,X0)) = X1,
inference(superposition,[status(thm)],[c_50,c_319]) ).
cnf(c_394,plain,
multiply(inverse(sP1_iProver_def),X0) = X0,
inference(superposition,[status(thm)],[c_303,c_363]) ).
cnf(c_638,plain,
inverse(sP1_iProver_def) = sP1_iProver_def,
inference(superposition,[status(thm)],[c_394,c_303]) ).
cnf(c_647,plain,
multiply(sP1_iProver_def,X0) = X0,
inference(demodulation,[status(thm)],[c_394,c_638]) ).
cnf(c_650,plain,
a2 = sP2_iProver_def,
inference(demodulation,[status(thm)],[c_69,c_647]) ).
cnf(c_654,plain,
sP2_iProver_def != sP2_iProver_def,
inference(demodulation,[status(thm)],[c_70,c_650]) ).
cnf(c_655,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_654]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP558-1 : TPTP v8.1.2. Released v2.6.0.
% 0.03/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n009.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:43:25 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
% 3.61/1.16 % SZS status Started for theBenchmark.p
% 3.61/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.61/1.16
% 3.61/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.61/1.16
% 3.61/1.16 ------ iProver source info
% 3.61/1.16
% 3.61/1.16 git: date: 2024-05-02 19:28:25 +0000
% 3.61/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.61/1.16 git: non_committed_changes: false
% 3.61/1.16
% 3.61/1.16 ------ Parsing...successful
% 3.61/1.16
% 3.61/1.16
% 3.61/1.16
% 3.61/1.16 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.61/1.16
% 3.61/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.61/1.16
% 3.61/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.61/1.16 ------ Proving...
% 3.61/1.16 ------ Problem Properties
% 3.61/1.16
% 3.61/1.16
% 3.61/1.16 clauses 6
% 3.61/1.16 conjectures 1
% 3.61/1.16 EPR 1
% 3.61/1.16 Horn 6
% 3.61/1.16 unary 6
% 3.61/1.16 binary 0
% 3.61/1.16 lits 6
% 3.61/1.16 lits eq 6
% 3.61/1.16 fd_pure 0
% 3.61/1.16 fd_pseudo 0
% 3.61/1.16 fd_cond 0
% 3.61/1.16 fd_pseudo_cond 0
% 3.61/1.16 AC symbols 0
% 3.61/1.16
% 3.61/1.16 ------ Input Options Time Limit: Unbounded
% 3.61/1.16
% 3.61/1.16
% 3.61/1.16 ------
% 3.61/1.16 Current options:
% 3.61/1.16 ------
% 3.61/1.16
% 3.61/1.16
% 3.61/1.16
% 3.61/1.16
% 3.61/1.16 ------ Proving...
% 3.61/1.16
% 3.61/1.16
% 3.61/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.61/1.16
% 3.61/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.61/1.16
% 3.61/1.16
%------------------------------------------------------------------------------