TSTP Solution File: ALG235-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : ALG235-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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:04:25 EDT 2024
% Result : Unsatisfiable 3.29s 1.13s
% Output : CNFRefutation 3.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 3 RR)
% Number of literals : 14 ( 13 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
mult(X0,mult(X1,mult(X0,X1))) = mult(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
cnf(c_50,plain,
mult(X0,mult(X1,mult(X2,X3))) = mult(X2,mult(X1,mult(X0,X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c_51,plain,
mult(mult(X0,mult(X1,mult(X2,X1))),X3) = mult(X0,mult(X3,mult(mult(X2,X1),X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
cnf(c_52,negated_conjecture,
mult(a,mult(b,mult(a,mult(c,mult(d,c))))) != mult(a,mult(b,mult(d,c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_64,plain,
mult(a,mult(c,mult(a,mult(b,mult(d,c))))) != mult(a,mult(b,mult(d,c))),
inference(demodulation,[status(thm)],[c_52,c_50]) ).
cnf(c_104,plain,
mult(X0,mult(X1,mult(X2,mult(X1,X0)))) = mult(X2,mult(X1,X0)),
inference(superposition,[status(thm)],[c_49,c_50]) ).
cnf(c_117,plain,
mult(X0,mult(X1,mult(X0,mult(mult(X1,X2),X2)))) = mult(X0,mult(X1,X2)),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_163,plain,
mult(mult(X0,X1),mult(X1,mult(X0,X1))) = mult(X0,X1),
inference(superposition,[status(thm)],[c_49,c_104]) ).
cnf(c_236,plain,
mult(X0,mult(X1,mult(mult(X0,X1),X1))) = mult(X0,X1),
inference(demodulation,[status(thm)],[c_163,c_50]) ).
cnf(c_462,plain,
mult(X0,mult(X1,mult(mult(X0,X2),X1))) = mult(mult(X0,X2),X1),
inference(superposition,[status(thm)],[c_49,c_51]) ).
cnf(c_559,plain,
mult(mult(X0,X1),X1) = mult(X0,X1),
inference(demodulation,[status(thm)],[c_236,c_462]) ).
cnf(c_982,plain,
mult(X0,mult(X1,mult(X0,mult(X1,X2)))) = mult(X0,mult(X1,X2)),
inference(demodulation,[status(thm)],[c_117,c_559]) ).
cnf(c_996,plain,
mult(X0,mult(X1,mult(X0,mult(X2,mult(X3,X1))))) = mult(X0,mult(X2,mult(X3,X1))),
inference(superposition,[status(thm)],[c_104,c_982]) ).
cnf(c_1018,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_64,c_996]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ALG235-1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n024.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 May 2 22:47:05 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running UEQ theorem proving
% 0.18/0.45 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.29/1.13 % SZS status Started for theBenchmark.p
% 3.29/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 3.29/1.13
% 3.29/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.29/1.13
% 3.29/1.13 ------ iProver source info
% 3.29/1.13
% 3.29/1.13 git: date: 2024-05-02 19:28:25 +0000
% 3.29/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.29/1.13 git: non_committed_changes: false
% 3.29/1.13
% 3.29/1.13 ------ Parsing...successful
% 3.29/1.13
% 3.29/1.13
% 3.29/1.13
% 3.29/1.13 ------ Preprocessing... sup_sim: 1 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.29/1.13
% 3.29/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.29/1.13
% 3.29/1.13 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.29/1.13 ------ Proving...
% 3.29/1.13 ------ Problem Properties
% 3.29/1.13
% 3.29/1.13
% 3.29/1.13 clauses 4
% 3.29/1.13 conjectures 0
% 3.29/1.13 EPR 0
% 3.29/1.13 Horn 4
% 3.29/1.13 unary 4
% 3.29/1.13 binary 0
% 3.29/1.13 lits 4
% 3.29/1.13 lits eq 4
% 3.29/1.13 fd_pure 0
% 3.29/1.13 fd_pseudo 0
% 3.29/1.13 fd_cond 0
% 3.29/1.13 fd_pseudo_cond 0
% 3.29/1.13 AC symbols 0
% 3.29/1.13
% 3.29/1.13 ------ Input Options Time Limit: Unbounded
% 3.29/1.13
% 3.29/1.13
% 3.29/1.13 ------
% 3.29/1.13 Current options:
% 3.29/1.13 ------
% 3.29/1.13
% 3.29/1.13
% 3.29/1.13
% 3.29/1.13
% 3.29/1.13 ------ Proving...
% 3.29/1.13
% 3.29/1.13
% 3.29/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 3.29/1.13
% 3.29/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.29/1.13
% 3.29/1.13
%------------------------------------------------------------------------------