TSTP Solution File: LCL065-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL065-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:17 EDT 2023
% Result : Unsatisfiable 17.26s 3.15s
% Output : CNFRefutation 17.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 23 ( 11 unt; 0 nHn; 12 RR)
% Number of literals : 39 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 50 ( 7 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(X0,implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_18) ).
cnf(c_51,plain,
is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_35) ).
cnf(c_52,plain,
is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_49) ).
cnf(c_53,negated_conjecture,
~ is_a_theorem(implies(implies(not(a),a),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_2) ).
cnf(c_4557,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_4573,plain,
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(implies(X0,X1),implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_4576,plain,
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(superposition,[status(thm)],[c_4573,c_49]) ).
cnf(c_4581,plain,
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X0)) ),
inference(superposition,[status(thm)],[c_50,c_4576]) ).
cnf(c_4582,plain,
( ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X0,X1)))
| is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_51,c_4576]) ).
cnf(c_4584,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X2,X0))
| is_a_theorem(implies(X2,X1)) ),
inference(superposition,[status(thm)],[c_4557,c_4576]) ).
cnf(c_4589,plain,
is_a_theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_50,c_4581]) ).
cnf(c_4598,plain,
( ~ is_a_theorem(implies(X0,implies(implies(X1,X2),X1)))
| is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_4573,c_4582]) ).
cnf(c_4610,plain,
( ~ is_a_theorem(implies(X0,implies(not(X1),not(X2))))
| is_a_theorem(implies(X0,implies(X2,X1))) ),
inference(superposition,[status(thm)],[c_52,c_4584]) ).
cnf(c_4612,plain,
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X3,implies(X0,X1)))
| is_a_theorem(implies(X3,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_4573,c_4584]) ).
cnf(c_4726,plain,
is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
inference(superposition,[status(thm)],[c_50,c_4598]) ).
cnf(c_4774,plain,
is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(superposition,[status(thm)],[c_50,c_4610]) ).
cnf(c_4877,plain,
( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
| is_a_theorem(implies(X0,implies(not(X1),X2))) ),
inference(superposition,[status(thm)],[c_4774,c_4612]) ).
cnf(c_4928,plain,
( ~ is_a_theorem(implies(X0,implies(X0,X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_4726,c_49]) ).
cnf(c_8995,plain,
is_a_theorem(implies(implies(not(X0),X0),implies(not(X0),X1))),
inference(superposition,[status(thm)],[c_4589,c_4877]) ).
cnf(c_13336,plain,
is_a_theorem(implies(implies(not(X0),X0),implies(X1,X0))),
inference(superposition,[status(thm)],[c_8995,c_4610]) ).
cnf(c_13380,plain,
is_a_theorem(implies(implies(not(X0),X0),X0)),
inference(superposition,[status(thm)],[c_13336,c_4928]) ).
cnf(c_18054,plain,
$false,
inference(superposition,[status(thm)],[c_13380,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL065-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 25 03:13:08 EDT 2023
% 0.12/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
% 17.26/3.15 % SZS status Started for theBenchmark.p
% 17.26/3.15 % SZS status Unsatisfiable for theBenchmark.p
% 17.26/3.15
% 17.26/3.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 17.26/3.15
% 17.26/3.15 ------ iProver source info
% 17.26/3.15
% 17.26/3.15 git: date: 2023-05-31 18:12:56 +0000
% 17.26/3.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 17.26/3.15 git: non_committed_changes: false
% 17.26/3.15 git: last_make_outside_of_git: false
% 17.26/3.15
% 17.26/3.15 ------ Parsing...successful
% 17.26/3.15
% 17.26/3.15
% 17.26/3.15
% 17.26/3.15 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 17.26/3.15
% 17.26/3.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 17.26/3.15 ------ Proving...
% 17.26/3.15 ------ Problem Properties
% 17.26/3.15
% 17.26/3.15
% 17.26/3.15 clauses 5
% 17.26/3.15 conjectures 1
% 17.26/3.15 EPR 0
% 17.26/3.15 Horn 5
% 17.26/3.15 unary 4
% 17.26/3.15 binary 0
% 17.26/3.15 lits 7
% 17.26/3.15 lits eq 0
% 17.26/3.15 fd_pure 0
% 17.26/3.15 fd_pseudo 0
% 17.26/3.15 fd_cond 0
% 17.26/3.15 fd_pseudo_cond 0
% 17.26/3.15 AC symbols 0
% 17.26/3.15
% 17.26/3.15 ------ Input Options Time Limit: Unbounded
% 17.26/3.15
% 17.26/3.15
% 17.26/3.15 ------
% 17.26/3.15 Current options:
% 17.26/3.15 ------
% 17.26/3.15
% 17.26/3.15
% 17.26/3.15
% 17.26/3.15
% 17.26/3.15 ------ Proving...
% 17.26/3.15
% 17.26/3.15
% 17.26/3.15 % SZS status Unsatisfiable for theBenchmark.p
% 17.26/3.15
% 17.26/3.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 17.26/3.15
% 17.26/3.15
%------------------------------------------------------------------------------