TSTP Solution File: COL061-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : COL061-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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:09:43 EDT 2024
% Result : Unsatisfiable 4.19s 1.18s
% Output : CNFRefutation 4.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 8 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
apply(apply(apply(b,X0),X1),X2) = apply(X0,apply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition) ).
cnf(c_50,plain,
apply(apply(t,X0),X1) = apply(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t_definition) ).
cnf(c_51,negated_conjecture,
apply(apply(apply(X0,f(X0)),g(X0)),h(X0)) != apply(f(X0),apply(h(X0),g(X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_q1_combinator) ).
cnf(c_92,plain,
apply(apply(apply(X0,apply(X1,f(apply(apply(b,X0),X1)))),g(apply(apply(b,X0),X1))),h(apply(apply(b,X0),X1))) != apply(f(apply(apply(b,X0),X1)),apply(h(apply(apply(b,X0),X1)),g(apply(apply(b,X0),X1)))),
inference(superposition,[status(thm)],[c_49,c_51]) ).
cnf(c_112,plain,
apply(apply(apply(apply(X0,f(apply(apply(b,apply(t,X1)),X0))),X1),g(apply(apply(b,apply(t,X1)),X0))),h(apply(apply(b,apply(t,X1)),X0))) != apply(f(apply(apply(b,apply(t,X1)),X0)),apply(h(apply(apply(b,apply(t,X1)),X0)),g(apply(apply(b,apply(t,X1)),X0)))),
inference(superposition,[status(thm)],[c_50,c_92]) ).
cnf(c_186,plain,
apply(apply(apply(apply(X0,apply(X1,f(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1))))),X2),g(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1)))),h(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1)))) != apply(f(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1))),apply(h(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1))),g(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1))))),
inference(superposition,[status(thm)],[c_49,c_112]) ).
cnf(c_662,plain,
apply(apply(apply(X0,f(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0)))),apply(X1,g(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0))))),h(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0)))) != apply(f(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0))),apply(h(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0))),g(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0))))),
inference(superposition,[status(thm)],[c_49,c_186]) ).
cnf(c_878,plain,
apply(f(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))),apply(apply(X0,g(apply(apply(b,apply(t,X0)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))))) != apply(f(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))),apply(h(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))),g(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))))),
inference(superposition,[status(thm)],[c_49,c_662]) ).
cnf(c_893,plain,
$false,
inference(superposition,[status(thm)],[c_50,c_878]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COL061-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 21:18:05 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running UEQ theorem proving
% 0.21/0.49 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
% 4.19/1.18 % SZS status Started for theBenchmark.p
% 4.19/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 4.19/1.18
% 4.19/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.19/1.18
% 4.19/1.18 ------ iProver source info
% 4.19/1.18
% 4.19/1.18 git: date: 2024-05-02 19:28:25 +0000
% 4.19/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.19/1.18 git: non_committed_changes: false
% 4.19/1.18
% 4.19/1.18 ------ Parsing...successful
% 4.19/1.18
% 4.19/1.18
% 4.19/1.18
% 4.19/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 4.19/1.18
% 4.19/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.19/1.18
% 4.19/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 4.19/1.18 ------ Proving...
% 4.19/1.18 ------ Problem Properties
% 4.19/1.18
% 4.19/1.18
% 4.19/1.18 clauses 3
% 4.19/1.18 conjectures 1
% 4.19/1.18 EPR 0
% 4.19/1.18 Horn 3
% 4.19/1.18 unary 3
% 4.19/1.18 binary 0
% 4.19/1.18 lits 3
% 4.19/1.18 lits eq 3
% 4.19/1.18 fd_pure 0
% 4.19/1.18 fd_pseudo 0
% 4.19/1.18 fd_cond 0
% 4.19/1.18 fd_pseudo_cond 0
% 4.19/1.18 AC symbols 0
% 4.19/1.18
% 4.19/1.18 ------ Input Options Time Limit: Unbounded
% 4.19/1.18
% 4.19/1.18
% 4.19/1.18 ------
% 4.19/1.18 Current options:
% 4.19/1.18 ------
% 4.19/1.18
% 4.19/1.18
% 4.19/1.18
% 4.19/1.18
% 4.19/1.18 ------ Proving...
% 4.19/1.18
% 4.19/1.18
% 4.19/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 4.19/1.18
% 4.19/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.19/1.18
% 4.19/1.18
%------------------------------------------------------------------------------