TSTP Solution File: COL002-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : COL002-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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 04:46:58 EDT 2024
% Result : Unsatisfiable 1.12s 1.11s
% Output : CNFRefutation 1.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 5 RR)
% Number of literals : 13 ( 12 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
apply(apply(X0,X1),apply(X2,X1)) = apply(apply(apply(s,X0),X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_definition) ).
cnf(c_50,plain,
apply(apply(apply(b,X0),X1),X2) = apply(X0,apply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition) ).
cnf(c_52,plain,
apply(i,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',i_definition) ).
cnf(c_53,negated_conjecture,
apply(fixed_pt,X0) != X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_fixed_point) ).
cnf(c_107,plain,
apply(apply(apply(s,i),X0),X1) = apply(X1,apply(X0,X1)),
inference(superposition,[status(thm)],[c_52,c_49]) ).
cnf(c_112,plain,
apply(apply(apply(s,X0),i),X1) = apply(apply(X0,X1),X1),
inference(superposition,[status(thm)],[c_52,c_49]) ).
cnf(c_151,plain,
apply(apply(apply(s,i),i),X0) = apply(X0,X0),
inference(superposition,[status(thm)],[c_52,c_107]) ).
cnf(c_337,plain,
apply(apply(apply(s,apply(b,X0)),i),X1) = apply(X0,apply(X1,X1)),
inference(superposition,[status(thm)],[c_112,c_50]) ).
cnf(c_1079,plain,
apply(apply(apply(s,apply(b,X0)),i),X1) = apply(X0,apply(apply(apply(s,i),i),X1)),
inference(superposition,[status(thm)],[c_151,c_337]) ).
cnf(c_1112,plain,
apply(apply(apply(s,apply(b,fixed_pt)),i),X0) != apply(X0,X0),
inference(superposition,[status(thm)],[c_337,c_53]) ).
cnf(c_1323,plain,
apply(fixed_pt,apply(apply(apply(s,i),i),X0)) != apply(X0,X0),
inference(demodulation,[status(thm)],[c_1112,c_1079]) ).
cnf(c_1330,plain,
apply(fixed_pt,apply(apply(apply(s,i),i),apply(apply(b,X0),X1))) != apply(X0,apply(X1,apply(apply(b,X0),X1))),
inference(superposition,[status(thm)],[c_50,c_1323]) ).
cnf(c_2342,plain,
$false,
inference(equality_resolution,[status(thm)],[c_1330]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.14 % Problem : COL002-1 : TPTP v8.2.0. Released v1.0.0.
% 0.05/0.14 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Jun 18 16:17:39 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.45 Running UEQ theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.12/1.11 % SZS status Started for theBenchmark.p
% 1.12/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 1.12/1.11
% 1.12/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.12/1.11
% 1.12/1.11 ------ iProver source info
% 1.12/1.11
% 1.12/1.11 git: date: 2024-06-12 09:56:46 +0000
% 1.12/1.11 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 1.12/1.11 git: non_committed_changes: false
% 1.12/1.11
% 1.12/1.11 ------ Parsing...successful
% 1.12/1.11
% 1.12/1.11
% 1.12/1.11
% 1.12/1.11 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 1.12/1.11
% 1.12/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.12/1.11
% 1.12/1.11 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.12/1.11 ------ Proving...
% 1.12/1.11 ------ Problem Properties
% 1.12/1.11
% 1.12/1.11
% 1.12/1.11 clauses 5
% 1.12/1.11 conjectures 1
% 1.12/1.11 EPR 0
% 1.12/1.11 Horn 5
% 1.12/1.11 unary 5
% 1.12/1.11 binary 0
% 1.12/1.11 lits 5
% 1.12/1.11 lits eq 5
% 1.12/1.11 fd_pure 0
% 1.12/1.11 fd_pseudo 0
% 1.12/1.11 fd_cond 0
% 1.12/1.11 fd_pseudo_cond 0
% 1.12/1.11 AC symbols 0
% 1.12/1.11
% 1.12/1.11 ------ Input Options Time Limit: Unbounded
% 1.12/1.11
% 1.12/1.11
% 1.12/1.11 ------
% 1.12/1.11 Current options:
% 1.12/1.11 ------
% 1.12/1.11
% 1.12/1.11
% 1.12/1.11
% 1.12/1.11
% 1.12/1.11 ------ Proving...
% 1.12/1.11
% 1.12/1.11
% 1.12/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 1.12/1.11
% 1.12/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.12/1.11
% 1.12/1.11
%------------------------------------------------------------------------------