TSTP Solution File: LCL430-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL430-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n004.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:37:50 EDT 2024
% Result : Unsatisfiable 14.54s 2.71s
% Output : CNFRefutation 14.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 10 unt; 0 nHn; 9 RR)
% Number of literals : 27 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-3 aty)
% Number of variables : 44 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ c_in(X0,c_PropLog_Othms(c_minus(X1,X2,tc_set(tc_PropLog_Opl(X3))),X3),tc_PropLog_Opl(X3))
| ~ c_lessequals(X1,X4,tc_set(tc_PropLog_Opl(X3)))
| c_in(X0,c_PropLog_Othms(c_minus(X4,X2,tc_set(tc_PropLog_Opl(X3))),X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_ODiff__weaken__left_0) ).
cnf(c_52,plain,
c_lessequals(c_PropLog_Ohyps(X0,c_insert(X1,X2,X3),X3),c_insert(c_PropLog_Opl_Ovar(X1,X3),c_minus(c_PropLog_Ohyps(X0,X2,X3),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X1,X3),c_PropLog_Opl_Ofalse,X3),c_emptyset,tc_PropLog_Opl(X3)),tc_set(tc_PropLog_Opl(X3))),tc_PropLog_Opl(X3)),tc_set(tc_PropLog_Opl(X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Ohyps__insert_0) ).
cnf(c_53,plain,
c_lessequals(c_minus(X0,X1,tc_set(X2)),c_insert(X3,c_minus(X0,c_insert(X3,X1,X2),tc_set(X2)),X2),tc_set(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oinsert__Diff__same_0) ).
cnf(c_54,plain,
c_lessequals(c_minus(c_insert(X0,c_minus(X1,c_insert(X2,c_emptyset,X3),tc_set(X3)),X3),X4,tc_set(X3)),c_insert(X0,c_minus(X1,c_insert(X2,X4,X3),tc_set(X3)),X3),tc_set(X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oinsert__Diff__subset2_0) ).
cnf(c_56,plain,
( ~ c_in(X0,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Ofalse,X2),X3,tc_PropLog_Opl(X2)),X2),tc_PropLog_Opl(X2))
| ~ c_in(X0,c_PropLog_Othms(c_insert(X1,X3,tc_PropLog_Opl(X2)),X2),tc_PropLog_Opl(X2))
| c_in(X0,c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms__excluded__middle__rule_0) ).
cnf(c_57,plain,
( ~ c_in(X0,c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2))
| ~ c_lessequals(X1,X3,tc_set(tc_PropLog_Opl(X2)))
| c_in(X0,c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__left_0) ).
cnf(c_61,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X0,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(c_63,negated_conjecture,
~ c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_v,t_a),c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(c_27507,plain,
( ~ c_lessequals(c_minus(c_PropLog_Ohyps(v_p,X0,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),X1,tc_set(tc_PropLog_Opl(t_a)))
| c_in(v_p,c_PropLog_Othms(X1,t_a),tc_PropLog_Opl(t_a)) ),
inference(superposition,[status(thm)],[c_61,c_57]) ).
cnf(c_27533,plain,
( ~ c_lessequals(c_PropLog_Ohyps(v_p,X0,t_a),X1,tc_set(tc_PropLog_Opl(t_a)))
| c_in(v_p,c_PropLog_Othms(c_minus(X1,v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)) ),
inference(superposition,[status(thm)],[c_61,c_49]) ).
cnf(c_27567,plain,
c_in(v_p,c_PropLog_Othms(c_insert(X0,c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(X0,v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(superposition,[status(thm)],[c_53,c_27507]) ).
cnf(c_27635,plain,
c_in(v_p,c_PropLog_Othms(c_minus(c_insert(c_PropLog_Opl_Ovar(X0,t_a),c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X0,t_a),c_PropLog_Opl_Ofalse,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
inference(superposition,[status(thm)],[c_52,c_27533]) ).
cnf(c_27804,plain,
( ~ c_in(v_p,c_PropLog_Othms(c_insert(X0,c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(X0,c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(X0,c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)) ),
inference(superposition,[status(thm)],[c_27567,c_56]) ).
cnf(c_28060,plain,
( ~ c_lessequals(c_minus(c_insert(c_PropLog_Opl_Ovar(X0,t_a),c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X0,t_a),c_PropLog_Opl_Ofalse,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),X2,tc_set(tc_PropLog_Opl(t_a)))
| c_in(v_p,c_PropLog_Othms(X2,t_a),tc_PropLog_Opl(t_a)) ),
inference(superposition,[status(thm)],[c_27635,c_57]) ).
cnf(c_29770,plain,
c_in(v_p,c_PropLog_Othms(c_insert(c_PropLog_Opl_Ovar(X0,t_a),c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X0,t_a),c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(superposition,[status(thm)],[c_54,c_28060]) ).
cnf(c_53054,plain,
c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X0,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X1,t_a),c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
inference(superposition,[status(thm)],[c_29770,c_27804]) ).
cnf(c_53056,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_63,c_53054]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL430-1 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n004.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu May 2 19:03:33 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 14.54/2.71 % SZS status Started for theBenchmark.p
% 14.54/2.71 % SZS status Unsatisfiable for theBenchmark.p
% 14.54/2.71
% 14.54/2.71 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 14.54/2.71
% 14.54/2.71 ------ iProver source info
% 14.54/2.71
% 14.54/2.71 git: date: 2024-05-02 19:28:25 +0000
% 14.54/2.71 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 14.54/2.71 git: non_committed_changes: false
% 14.54/2.71
% 14.54/2.71 ------ Parsing...successful
% 14.54/2.71
% 14.54/2.71
% 14.54/2.71
% 14.54/2.71 ------ Preprocessing... sup_sim: 1 sf_s rm: 825 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: 70 0s sf_e pe_s pe_e
% 14.54/2.71
% 14.54/2.71 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 14.54/2.71
% 14.54/2.71 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 14.54/2.71 ------ Proving...
% 14.54/2.71 ------ Problem Properties
% 14.54/2.71
% 14.54/2.71
% 14.54/2.71 clauses 315
% 14.54/2.71 conjectures 4
% 14.54/2.71 EPR 26
% 14.54/2.71 Horn 288
% 14.54/2.71 unary 86
% 14.54/2.71 binary 178
% 14.54/2.71 lits 595
% 14.54/2.71 lits eq 171
% 14.54/2.71 fd_pure 0
% 14.54/2.71 fd_pseudo 0
% 14.54/2.71 fd_cond 21
% 14.54/2.71 fd_pseudo_cond 43
% 14.54/2.71 AC symbols 0
% 14.54/2.71
% 14.54/2.71 ------ Input Options Time Limit: Unbounded
% 14.54/2.71
% 14.54/2.71
% 14.54/2.71 ------
% 14.54/2.71 Current options:
% 14.54/2.71 ------
% 14.54/2.71
% 14.54/2.71
% 14.54/2.71
% 14.54/2.71
% 14.54/2.71 ------ Proving...
% 14.54/2.71
% 14.54/2.71
% 14.54/2.71 % SZS status Unsatisfiable for theBenchmark.p
% 14.54/2.71
% 14.54/2.71 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 14.54/2.71
% 14.54/2.71
%------------------------------------------------------------------------------