TSTP Solution File: GRP698-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : GRP698-1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 : Mon Jun 24 07:01:49 EDT 2024
% Result : Unsatisfiable 3.65s 1.16s
% Output : CNFRefutation 3.65s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
mult(X0,ld(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c_50,plain,
ld(X0,mult(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c_51,plain,
mult(rd(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(c_52,plain,
rd(mult(X0,X1),X1) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(c_53,plain,
mult(X0,unit) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c_55,plain,
mult(mult(mult(X0,X1),X0),mult(X0,X2)) = mult(X0,mult(mult(mult(X1,X0),X0),X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c_57,negated_conjecture,
mult(rd(mult(a,b),a),mult(a,c)) != mult(a,mult(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_89,plain,
mult(a,b) = sP0_iProver_def,
definition ).
cnf(c_90,plain,
rd(sP0_iProver_def,a) = sP1_iProver_def,
definition ).
cnf(c_91,plain,
mult(a,c) = sP2_iProver_def,
definition ).
cnf(c_92,plain,
mult(sP1_iProver_def,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_93,plain,
mult(b,c) = sP4_iProver_def,
definition ).
cnf(c_94,plain,
mult(a,sP4_iProver_def) = sP5_iProver_def,
definition ).
cnf(c_95,negated_conjecture,
sP3_iProver_def != sP5_iProver_def,
inference(demodulation,[status(thm)],[c_57,c_93,c_94,c_91,c_89,c_90,c_92]) ).
cnf(c_304,plain,
mult(X0,mult(mult(mult(X1,X0),X0),unit)) = mult(mult(mult(X0,X1),X0),X0),
inference(superposition,[status(thm)],[c_53,c_55]) ).
cnf(c_318,plain,
mult(mult(mult(X0,X1),X0),X0) = mult(X0,mult(mult(X1,X0),X0)),
inference(demodulation,[status(thm)],[c_304,c_53]) ).
cnf(c_355,plain,
mult(X0,mult(mult(ld(X0,X1),X0),X0)) = mult(mult(X1,X0),X0),
inference(superposition,[status(thm)],[c_49,c_318]) ).
cnf(c_775,plain,
ld(X0,mult(mult(X1,X0),X0)) = mult(mult(ld(X0,X1),X0),X0),
inference(superposition,[status(thm)],[c_355,c_50]) ).
cnf(c_1001,plain,
ld(a,sP0_iProver_def) = b,
inference(superposition,[status(thm)],[c_89,c_50]) ).
cnf(c_1013,plain,
mult(sP1_iProver_def,a) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_90,c_51]) ).
cnf(c_1060,plain,
mult(mult(ld(X0,rd(X1,X0)),X0),X0) = ld(X0,mult(X1,X0)),
inference(superposition,[status(thm)],[c_51,c_775]) ).
cnf(c_1355,plain,
mult(ld(X0,rd(X1,X0)),X0) = rd(ld(X0,mult(X1,X0)),X0),
inference(superposition,[status(thm)],[c_1060,c_52]) ).
cnf(c_1603,plain,
mult(ld(a,rd(sP1_iProver_def,a)),a) = rd(ld(a,sP0_iProver_def),a),
inference(superposition,[status(thm)],[c_1013,c_1355]) ).
cnf(c_1627,plain,
mult(ld(a,rd(sP1_iProver_def,a)),a) = rd(b,a),
inference(demodulation,[status(thm)],[c_1603,c_1001]) ).
cnf(c_1640,plain,
ld(a,rd(sP1_iProver_def,a)) = rd(rd(b,a),a),
inference(superposition,[status(thm)],[c_1627,c_52]) ).
cnf(c_1652,plain,
mult(a,rd(rd(b,a),a)) = rd(sP1_iProver_def,a),
inference(superposition,[status(thm)],[c_1640,c_49]) ).
cnf(c_1771,plain,
mult(a,mult(mult(mult(rd(rd(b,a),a),a),a),X0)) = mult(mult(rd(sP1_iProver_def,a),a),mult(a,X0)),
inference(superposition,[status(thm)],[c_1652,c_55]) ).
cnf(c_1818,plain,
mult(a,mult(b,X0)) = mult(sP1_iProver_def,mult(a,X0)),
inference(demodulation,[status(thm)],[c_1771,c_51]) ).
cnf(c_3416,plain,
mult(sP1_iProver_def,mult(a,c)) = mult(a,sP4_iProver_def),
inference(superposition,[status(thm)],[c_93,c_1818]) ).
cnf(c_3434,plain,
sP3_iProver_def = sP5_iProver_def,
inference(demodulation,[status(thm)],[c_3416,c_91,c_92,c_94]) ).
cnf(c_3435,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3434,c_95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP698-1 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n017.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu Jun 20 12:40:54 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.19/0.46 Running UEQ theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.65/1.16 % SZS status Started for theBenchmark.p
% 3.65/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.65/1.16
% 3.65/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.65/1.16
% 3.65/1.16 ------ iProver source info
% 3.65/1.16
% 3.65/1.16 git: date: 2024-06-12 09:56:46 +0000
% 3.65/1.16 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 3.65/1.16 git: non_committed_changes: false
% 3.65/1.16
% 3.65/1.16 ------ Parsing...successful
% 3.65/1.16
% 3.65/1.16
% 3.65/1.16
% 3.65/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.65/1.16
% 3.65/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.65/1.16
% 3.65/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.65/1.16 ------ Proving...
% 3.65/1.16 ------ Problem Properties
% 3.65/1.16
% 3.65/1.16
% 3.65/1.16 clauses 15
% 3.65/1.16 conjectures 1
% 3.65/1.16 EPR 1
% 3.65/1.16 Horn 15
% 3.65/1.16 unary 15
% 3.65/1.16 binary 0
% 3.65/1.16 lits 15
% 3.65/1.16 lits eq 15
% 3.65/1.16 fd_pure 0
% 3.65/1.16 fd_pseudo 0
% 3.65/1.16 fd_cond 0
% 3.65/1.16 fd_pseudo_cond 0
% 3.65/1.16 AC symbols 0
% 3.65/1.16
% 3.65/1.16 ------ Input Options Time Limit: Unbounded
% 3.65/1.16
% 3.65/1.16
% 3.65/1.16 ------
% 3.65/1.16 Current options:
% 3.65/1.16 ------
% 3.65/1.16
% 3.65/1.16
% 3.65/1.16
% 3.65/1.16
% 3.65/1.16 ------ Proving...
% 3.65/1.16
% 3.65/1.16
% 3.65/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.65/1.16
% 3.65/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.65/1.16
% 3.65/1.16
%------------------------------------------------------------------------------