TSTP Solution File: COL030-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : COL030-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:47:23 EDT 2024
% Result : Unsatisfiable 0.49s 1.17s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 5 RR)
% Number of literals : 9 ( 8 equ; 3 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 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(X0,apply(X1,X1)) = apply(apply(l,X0),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_definition) ).
cnf(c_51,negated_conjecture,
apply(f(X0),apply(X0,f(X0))) != apply(X0,f(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_fixed_point) ).
cnf(c_110,plain,
apply(X0,apply(apply(apply(s,X1),X1),X2)) = apply(apply(l,X0),apply(X1,X2)),
inference(superposition,[status(thm)],[c_49,c_50]) ).
cnf(c_243,plain,
apply(apply(X0,f(apply(apply(s,X0),X1))),apply(X1,f(apply(apply(s,X0),X1)))) = apply(apply(apply(s,X0),X1),f(apply(apply(s,X0),X1))),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_245,plain,
apply(apply(l,f(apply(apply(s,l),l))),apply(l,f(apply(apply(s,l),l)))) = apply(apply(apply(s,l),l),f(apply(apply(s,l),l))),
inference(instantiation,[status(thm)],[c_243]) ).
cnf(c_634,plain,
apply(apply(l,f(apply(apply(s,X0),X0))),apply(X0,f(apply(apply(s,X0),X0)))) != apply(apply(apply(s,X0),X0),f(apply(apply(s,X0),X0))),
inference(superposition,[status(thm)],[c_110,c_51]) ).
cnf(c_674,plain,
apply(apply(l,f(apply(apply(s,l),l))),apply(l,f(apply(apply(s,l),l)))) != apply(apply(apply(s,l),l),f(apply(apply(s,l),l))),
inference(instantiation,[status(thm)],[c_634]) ).
cnf(c_675,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_674,c_245]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL030-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Jun 18 15:56:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.46 Running UEQ theorem proving
% 0.20/0.46 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
% 0.49/1.17 % SZS status Started for theBenchmark.p
% 0.49/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.49/1.17
% 0.49/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.49/1.17
% 0.49/1.17 ------ iProver source info
% 0.49/1.17
% 0.49/1.17 git: date: 2024-06-12 09:56:46 +0000
% 0.49/1.17 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 0.49/1.17 git: non_committed_changes: false
% 0.49/1.17
% 0.49/1.17 ------ Parsing...successful
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.49/1.17
% 0.49/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.49/1.17
% 0.49/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.49/1.17 ------ Proving...
% 0.49/1.17 ------ Problem Properties
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 clauses 3
% 0.49/1.17 conjectures 1
% 0.49/1.17 EPR 0
% 0.49/1.17 Horn 3
% 0.49/1.17 unary 3
% 0.49/1.17 binary 0
% 0.49/1.17 lits 3
% 0.49/1.17 lits eq 3
% 0.49/1.17 fd_pure 0
% 0.49/1.17 fd_pseudo 0
% 0.49/1.17 fd_cond 0
% 0.49/1.17 fd_pseudo_cond 0
% 0.49/1.17 AC symbols 0
% 0.49/1.17
% 0.49/1.17 ------ Input Options Time Limit: Unbounded
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 ------
% 0.49/1.17 Current options:
% 0.49/1.17 ------
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 ------ Proving...
% 0.49/1.17
% 0.49/1.17
% 0.49/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.49/1.17
% 0.49/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.49/1.17
% 0.49/1.17
%------------------------------------------------------------------------------