TSTP Solution File: COL123-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : COL123-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:59 EDT 2024
% Result : Unsatisfiable 115.51s 16.29s
% Output : CNFRefutation 115.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 18 ( 3 unt; 0 nHn; 18 RR)
% Number of literals : 40 ( 0 equ; 29 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-4 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_57,plain,
( ~ c_in(c_Pair(X0,X1,X2,X2),c_Transitive__Closure_Ortrancl(X3,X2),tc_prod(X2,X2))
| ~ c_in(c_Pair(X4,X0,X2,X2),c_Transitive__Closure_Ortrancl(X3,X2),tc_prod(X2,X2))
| c_in(c_Pair(X4,X1,X2,X2),c_Transitive__Closure_Ortrancl(X3,X2),tc_prod(X2,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Transitive__Closure_Ortrancl__trans_0) ).
cnf(c_59,negated_conjecture,
c_in(c_Pair(v_y,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_60,negated_conjecture,
c_in(c_Pair(v_x,v_xb,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_61,negated_conjecture,
( ~ c_in(c_Pair(v_x,X0,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X0,v_xaa(X0),t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(c_62,negated_conjecture,
( ~ c_in(c_Pair(v_x,X0,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(v_y,v_xaa(X0),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(c_63,negated_conjecture,
( ~ c_in(c_Pair(v_xb,X0,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_z,X0,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(c_64,negated_conjecture,
( ~ c_in(c_Pair(X0,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X0,X2,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X1,v_xa(X0,X1,X2),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_6) ).
cnf(c_65,negated_conjecture,
( ~ c_in(c_Pair(X0,X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X0,X2,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X2,v_xa(X0,X1,X2),t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_7) ).
cnf(c_184,plain,
( ~ c_in(X0,X1,tc_prod(X2,X2))
| c_in(X0,c_Transitive__Closure_Ortrancl(X1,X2),tc_prod(X2,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Transitive__Closure_Or__into__rtrancl_0) ).
cnf(c_21531,plain,
( ~ c_in(c_Pair(X0,X1,X2,X2),c_Transitive__Closure_Ortrancl(X3,X2),tc_prod(X2,X2))
| ~ c_in(c_Pair(X1,X4,X2,X2),X3,tc_prod(X2,X2))
| c_in(c_Pair(X0,X4,X2,X2),c_Transitive__Closure_Ortrancl(X3,X2),tc_prod(X2,X2)) ),
inference(superposition,[status(thm)],[c_184,c_57]) ).
cnf(c_21615,plain,
( ~ c_in(c_Pair(v_xaa(X0),X1,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,X0,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(X0,X1,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ),
inference(superposition,[status(thm)],[c_61,c_21531]) ).
cnf(c_21797,plain,
( ~ c_in(c_Pair(v_xaa(v_xb),X0,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_z,X0,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_x,v_xb,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(superposition,[status(thm)],[c_21615,c_63]) ).
cnf(c_21837,plain,
( ~ c_in(c_Pair(v_z,X0,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_xaa(v_xb),X0,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(global_subsumption_just,[status(thm)],[c_21797,c_60,c_21797]) ).
cnf(c_21838,plain,
( ~ c_in(c_Pair(v_xaa(v_xb),X0,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_z,X0,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(renaming,[status(thm)],[c_21837]) ).
cnf(c_21840,plain,
( ~ c_in(c_Pair(v_z,v_xa(X0,v_xaa(v_xb),X1),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X0,v_xaa(v_xb),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X0,X1,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(superposition,[status(thm)],[c_64,c_21838]) ).
cnf(c_21848,plain,
( ~ c_in(c_Pair(X0,v_xaa(v_xb),t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(X0,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(superposition,[status(thm)],[c_65,c_21840]) ).
cnf(c_21855,plain,
( ~ c_in(c_Pair(v_x,v_xb,t_a,t_a),v_r,tc_prod(t_a,t_a))
| ~ c_in(c_Pair(v_y,v_z,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
inference(superposition,[status(thm)],[c_62,c_21848]) ).
cnf(c_21856,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_21855,c_59,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : COL123-1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n028.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:44:48 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 115.51/16.29 % SZS status Started for theBenchmark.p
% 115.51/16.29 % SZS status Unsatisfiable for theBenchmark.p
% 115.51/16.29
% 115.51/16.29 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 115.51/16.29
% 115.51/16.29 ------ iProver source info
% 115.51/16.29
% 115.51/16.29 git: date: 2024-05-02 19:28:25 +0000
% 115.51/16.29 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 115.51/16.29 git: non_committed_changes: false
% 115.51/16.29
% 115.51/16.29 ------ Parsing...successful
% 115.51/16.29
% 115.51/16.29
% 115.51/16.29
% 115.51/16.29 ------ Preprocessing... sup_sim: 0 sf_s rm: 823 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e sup_sim: 0 sf_s rm: 69 0s sf_e pe_s pe_e
% 115.51/16.29
% 115.51/16.29 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 115.51/16.29
% 115.51/16.29 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 115.51/16.29 ------ Proving...
% 115.51/16.29 ------ Problem Properties
% 115.51/16.29
% 115.51/16.29
% 115.51/16.29 clauses 310
% 115.51/16.29 conjectures 8
% 115.51/16.29 EPR 27
% 115.51/16.29 Horn 283
% 115.51/16.29 unary 82
% 115.51/16.29 binary 178
% 115.51/16.29 lits 588
% 115.51/16.29 lits eq 169
% 115.51/16.29 fd_pure 0
% 115.51/16.29 fd_pseudo 0
% 115.51/16.29 fd_cond 21
% 115.51/16.29 fd_pseudo_cond 42
% 115.51/16.29 AC symbols 0
% 115.51/16.29
% 115.51/16.29 ------ Input Options Time Limit: Unbounded
% 115.51/16.29
% 115.51/16.29
% 115.51/16.29 ------
% 115.51/16.29 Current options:
% 115.51/16.29 ------
% 115.51/16.29
% 115.51/16.29
% 115.51/16.29
% 115.51/16.29
% 115.51/16.29 ------ Proving...
% 115.51/16.29
% 115.51/16.29
% 115.51/16.29 % SZS status Unsatisfiable for theBenchmark.p
% 115.51/16.29
% 115.51/16.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 115.51/16.29
% 115.51/16.29
%------------------------------------------------------------------------------