TSTP Solution File: GRP538-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP538-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 1.79s 1.01s
% Output : CNFRefutation 1.79s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
divide(divide(X0,X1),divide(divide(X0,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(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
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_77,plain,
inverse(b2) = sP0_iProver_def,
definition ).
cnf(c_78,plain,
multiply(sP0_iProver_def,b2) = sP1_iProver_def,
definition ).
cnf(c_79,plain,
multiply(sP1_iProver_def,a2) = sP2_iProver_def,
definition ).
cnf(c_80,negated_conjecture,
sP2_iProver_def != a2,
inference(demodulation,[status(thm)],[c_53,c_77,c_78,c_79]) ).
cnf(c_134,plain,
divide(X0,sP0_iProver_def) = multiply(X0,b2),
inference(superposition,[status(thm)],[c_77,c_69]) ).
cnf(c_138,plain,
divide(sP0_iProver_def,sP0_iProver_def) = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_78,c_134]) ).
cnf(c_170,plain,
identity = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_138,c_52]) ).
cnf(c_172,plain,
divide(sP1_iProver_def,X0) = inverse(X0),
inference(demodulation,[status(thm)],[c_68,c_170]) ).
cnf(c_173,plain,
divide(X0,X0) = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_52,c_170]) ).
cnf(c_183,plain,
divide(sP1_iProver_def,divide(divide(X0,X1),X0)) = X1,
inference(superposition,[status(thm)],[c_173,c_49]) ).
cnf(c_197,plain,
multiply(sP1_iProver_def,X0) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_172,c_69]) ).
cnf(c_474,plain,
inverse(divide(divide(X0,X1),X0)) = X1,
inference(demodulation,[status(thm)],[c_183,c_172]) ).
cnf(c_477,plain,
inverse(divide(sP1_iProver_def,X0)) = X0,
inference(superposition,[status(thm)],[c_173,c_474]) ).
cnf(c_488,plain,
multiply(sP1_iProver_def,X0) = X0,
inference(light_normalisation,[status(thm)],[c_477,c_172,c_197]) ).
cnf(c_492,plain,
a2 = sP2_iProver_def,
inference(demodulation,[status(thm)],[c_79,c_488]) ).
cnf(c_495,plain,
sP2_iProver_def != sP2_iProver_def,
inference(demodulation,[status(thm)],[c_80,c_492]) ).
cnf(c_496,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_495]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRP538-1 : TPTP v8.1.2. Released v2.6.0.
% 0.09/0.09 % Command : run_iprover %s %d THM
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Thu May 2 23:54:08 EDT 2024
% 0.09/0.28 % CPUTime :
% 0.13/0.37 Running UEQ theorem proving
% 0.13/0.37 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
% 1.79/1.01 % SZS status Started for theBenchmark.p
% 1.79/1.01 % SZS status Unsatisfiable for theBenchmark.p
% 1.79/1.01
% 1.79/1.01 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.79/1.01
% 1.79/1.01 ------ iProver source info
% 1.79/1.01
% 1.79/1.01 git: date: 2024-05-02 19:28:25 +0000
% 1.79/1.01 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.79/1.01 git: non_committed_changes: false
% 1.79/1.01
% 1.79/1.01 ------ Parsing...successful
% 1.79/1.01
% 1.79/1.01
% 1.79/1.01
% 1.79/1.01 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 1.79/1.01
% 1.79/1.01 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.79/1.01
% 1.79/1.01 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.79/1.01 ------ Proving...
% 1.79/1.01 ------ Problem Properties
% 1.79/1.01
% 1.79/1.01
% 1.79/1.01 clauses 8
% 1.79/1.01 conjectures 1
% 1.79/1.01 EPR 1
% 1.79/1.01 Horn 8
% 1.79/1.01 unary 8
% 1.79/1.01 binary 0
% 1.79/1.01 lits 8
% 1.79/1.01 lits eq 8
% 1.79/1.01 fd_pure 0
% 1.79/1.01 fd_pseudo 0
% 1.79/1.01 fd_cond 0
% 1.79/1.01 fd_pseudo_cond 0
% 1.79/1.01 AC symbols 0
% 1.79/1.01
% 1.79/1.01 ------ Input Options Time Limit: Unbounded
% 1.79/1.01
% 1.79/1.01
% 1.79/1.01 ------
% 1.79/1.01 Current options:
% 1.79/1.01 ------
% 1.79/1.01
% 1.79/1.01
% 1.79/1.01
% 1.79/1.01
% 1.79/1.01 ------ Proving...
% 1.79/1.01
% 1.79/1.01
% 1.79/1.01 % SZS status Unsatisfiable for theBenchmark.p
% 1.79/1.01
% 1.79/1.01 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.79/1.01
% 1.79/1.01
%------------------------------------------------------------------------------