TSTP Solution File: LCL075-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL075-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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 : Thu Aug 31 07:42:20 EDT 2023
% Result : Unsatisfiable 8.08s 1.66s
% Output : CNFRefutation 8.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of clauses : 15 ( 11 unt; 0 nHn; 5 RR)
% Number of literals : 20 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(c_50,plain,
is_a_theorem(implies(implies(implies(implies(implies(X0,X1),implies(not(X2),not(X3))),X2),X4),implies(implies(X4,X0),implies(X3,X0)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_CAMerideth) ).
cnf(c_51,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_3) ).
cnf(c_66,plain,
( ~ is_a_theorem(implies(implies(implies(implies(X0,X1),implies(not(X2),not(X3))),X2),X4))
| is_a_theorem(implies(implies(X4,X0),implies(X3,X0))) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_72,plain,
is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))),
inference(superposition,[status(thm)],[c_50,c_66]) ).
cnf(c_75,plain,
is_a_theorem(implies(implies(implies(X0,implies(not(X1),X2)),X3),implies(X1,X3))),
inference(superposition,[status(thm)],[c_72,c_66]) ).
cnf(c_83,plain,
is_a_theorem(implies(implies(implies(X0,X0),X1),implies(X2,X1))),
inference(superposition,[status(thm)],[c_75,c_66]) ).
cnf(c_99,plain,
( ~ is_a_theorem(implies(implies(X0,X0),X1))
| is_a_theorem(implies(X2,X1)) ),
inference(superposition,[status(thm)],[c_83,c_49]) ).
cnf(c_140,plain,
is_a_theorem(implies(X0,implies(X1,implies(X2,X2)))),
inference(superposition,[status(thm)],[c_83,c_99]) ).
cnf(c_215,plain,
is_a_theorem(implies(implies(implies(X0,implies(X1,X1)),X2),implies(X3,X2))),
inference(superposition,[status(thm)],[c_140,c_66]) ).
cnf(c_480,plain,
is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))),
inference(superposition,[status(thm)],[c_215,c_66]) ).
cnf(c_1351,plain,
is_a_theorem(implies(implies(implies(implies(not(X0),not(X1)),X0),X2),implies(X1,X2))),
inference(superposition,[status(thm)],[c_480,c_66]) ).
cnf(c_6767,plain,
( ~ is_a_theorem(implies(implies(implies(not(X0),not(X1)),X0),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(superposition,[status(thm)],[c_1351,c_49]) ).
cnf(c_47956,plain,
is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(superposition,[status(thm)],[c_480,c_6767]) ).
cnf(c_48282,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_47956]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL075-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 23:58:32 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 8.08/1.66 % SZS status Started for theBenchmark.p
% 8.08/1.66 % SZS status Unsatisfiable for theBenchmark.p
% 8.08/1.66
% 8.08/1.66 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 8.08/1.66
% 8.08/1.66 ------ iProver source info
% 8.08/1.66
% 8.08/1.66 git: date: 2023-05-31 18:12:56 +0000
% 8.08/1.66 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 8.08/1.66 git: non_committed_changes: false
% 8.08/1.66 git: last_make_outside_of_git: false
% 8.08/1.66
% 8.08/1.66 ------ Parsing...successful
% 8.08/1.66
% 8.08/1.66
% 8.08/1.66
% 8.08/1.66 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 8.08/1.66
% 8.08/1.66 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 8.08/1.66 ------ Proving...
% 8.08/1.66 ------ Problem Properties
% 8.08/1.66
% 8.08/1.66
% 8.08/1.66 clauses 3
% 8.08/1.66 conjectures 1
% 8.08/1.66 EPR 0
% 8.08/1.66 Horn 3
% 8.08/1.66 unary 2
% 8.08/1.66 binary 0
% 8.08/1.66 lits 5
% 8.08/1.66 lits eq 0
% 8.08/1.66 fd_pure 0
% 8.08/1.66 fd_pseudo 0
% 8.08/1.66 fd_cond 0
% 8.08/1.66 fd_pseudo_cond 0
% 8.08/1.66 AC symbols 0
% 8.08/1.66
% 8.08/1.66 ------ Input Options Time Limit: Unbounded
% 8.08/1.66
% 8.08/1.66
% 8.08/1.66 ------
% 8.08/1.66 Current options:
% 8.08/1.66 ------
% 8.08/1.66
% 8.08/1.66
% 8.08/1.66
% 8.08/1.66
% 8.08/1.66 ------ Proving...
% 8.08/1.66
% 8.08/1.66
% 8.08/1.66 % SZS status Unsatisfiable for theBenchmark.p
% 8.08/1.66
% 8.08/1.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.08/1.66
% 8.08/1.66
%------------------------------------------------------------------------------