TSTP Solution File: GRP533-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP533-1 : TPTP v8.1.2. Released v2.6.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:51 EDT 2024
% Result : Unsatisfiable 1.64s 1.10s
% Output : CNFRefutation 1.64s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
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(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
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(a1) = sP0_iProver_def,
definition ).
cnf(c_78,plain,
multiply(sP0_iProver_def,a1) = sP1_iProver_def,
definition ).
cnf(c_79,plain,
inverse(b1) = sP2_iProver_def,
definition ).
cnf(c_80,plain,
multiply(sP2_iProver_def,b1) = sP3_iProver_def,
definition ).
cnf(c_81,negated_conjecture,
sP1_iProver_def != sP3_iProver_def,
inference(demodulation,[status(thm)],[c_53,c_79,c_80,c_77,c_78]) ).
cnf(c_137,plain,
divide(X0,sP0_iProver_def) = multiply(X0,a1),
inference(superposition,[status(thm)],[c_77,c_69]) ).
cnf(c_138,plain,
divide(X0,sP2_iProver_def) = multiply(X0,b1),
inference(superposition,[status(thm)],[c_79,c_69]) ).
cnf(c_142,plain,
divide(sP0_iProver_def,sP0_iProver_def) = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_78,c_137]) ).
cnf(c_143,plain,
divide(sP2_iProver_def,sP2_iProver_def) = sP3_iProver_def,
inference(demodulation,[status(thm)],[c_80,c_138]) ).
cnf(c_173,plain,
identity = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_142,c_52]) ).
cnf(c_176,plain,
divide(X0,X0) = sP1_iProver_def,
inference(demodulation,[status(thm)],[c_52,c_173]) ).
cnf(c_181,plain,
sP1_iProver_def = sP3_iProver_def,
inference(demodulation,[status(thm)],[c_143,c_176]) ).
cnf(c_182,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_181,c_81]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : GRP533-1 : TPTP v8.1.2. Released v2.6.0.
% 0.02/0.11 % Command : run_iprover %s %d THM
% 0.11/0.30 % Computer : n015.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Fri May 3 00:18:06 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.15/0.42 Running UEQ theorem proving
% 0.15/0.42 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.64/1.10 % SZS status Started for theBenchmark.p
% 1.64/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 1.64/1.10
% 1.64/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.64/1.10
% 1.64/1.10 ------ iProver source info
% 1.64/1.10
% 1.64/1.10 git: date: 2024-05-02 19:28:25 +0000
% 1.64/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.64/1.10 git: non_committed_changes: false
% 1.64/1.10
% 1.64/1.10 ------ Parsing...successful
% 1.64/1.10
% 1.64/1.10
% 1.64/1.10
% 1.64/1.10 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 1.64/1.10
% 1.64/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.64/1.10
% 1.64/1.10 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.64/1.10 ------ Proving...
% 1.64/1.10 ------ Problem Properties
% 1.64/1.10
% 1.64/1.10
% 1.64/1.10 clauses 9
% 1.64/1.10 conjectures 1
% 1.64/1.10 EPR 1
% 1.64/1.10 Horn 9
% 1.64/1.10 unary 9
% 1.64/1.10 binary 0
% 1.64/1.10 lits 9
% 1.64/1.10 lits eq 9
% 1.64/1.10 fd_pure 0
% 1.64/1.10 fd_pseudo 0
% 1.64/1.10 fd_cond 0
% 1.64/1.10 fd_pseudo_cond 0
% 1.64/1.10 AC symbols 0
% 1.64/1.10
% 1.64/1.10 ------ Input Options Time Limit: Unbounded
% 1.64/1.10
% 1.64/1.10
% 1.64/1.10 ------
% 1.64/1.10 Current options:
% 1.64/1.10 ------
% 1.64/1.10
% 1.64/1.10
% 1.64/1.10
% 1.64/1.10
% 1.64/1.10 ------ Proving...
% 1.64/1.10
% 1.64/1.10
% 1.64/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 1.64/1.10
% 1.64/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.64/1.10
% 1.64/1.10
%------------------------------------------------------------------------------