TSTP Solution File: LCL066-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL066-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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:36:44 EDT 2024
% Result : Unsatisfiable 3.91s 1.16s
% Output : CNFRefutation 3.91s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% 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(a,implies(not(a),b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_3) ).
cnf(c_71,plain,
not(a) = sP0_iProver_def,
definition ).
cnf(c_72,plain,
implies(sP0_iProver_def,b) = sP1_iProver_def,
definition ).
cnf(c_73,plain,
implies(a,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_74,negated_conjecture,
~ is_a_theorem(sP2_iProver_def),
inference(demodulation,[status(thm)],[c_53,c_71,c_72,c_73]) ).
cnf(c_180,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_212,plain,
is_a_theorem(implies(implies(sP0_iProver_def,implies(X0,b)),implies(implies(sP0_iProver_def,X0),sP1_iProver_def))),
inference(superposition,[status(thm)],[c_72,c_51]) ).
cnf(c_213,plain,
is_a_theorem(implies(implies(a,implies(X0,sP1_iProver_def)),implies(implies(a,X0),sP2_iProver_def))),
inference(superposition,[status(thm)],[c_73,c_51]) ).
cnf(c_214,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_531,plain,
( ~ is_a_theorem(implies(sP0_iProver_def,implies(X0,b)))
| is_a_theorem(implies(implies(sP0_iProver_def,X0),sP1_iProver_def)) ),
inference(superposition,[status(thm)],[c_212,c_49]) ).
cnf(c_537,plain,
( ~ is_a_theorem(implies(a,implies(X0,sP1_iProver_def)))
| is_a_theorem(implies(implies(a,X0),sP2_iProver_def)) ),
inference(superposition,[status(thm)],[c_213,c_49]) ).
cnf(c_591,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_214,c_49]) ).
cnf(c_690,plain,
( ~ is_a_theorem(implies(X0,sP1_iProver_def))
| is_a_theorem(implies(implies(a,X0),sP2_iProver_def)) ),
inference(superposition,[status(thm)],[c_180,c_537]) ).
cnf(c_701,plain,
( ~ is_a_theorem(implies(X0,sP1_iProver_def))
| ~ is_a_theorem(implies(a,X0))
| is_a_theorem(sP2_iProver_def) ),
inference(superposition,[status(thm)],[c_690,c_49]) ).
cnf(c_702,plain,
( ~ is_a_theorem(implies(X0,sP1_iProver_def))
| ~ is_a_theorem(implies(a,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_701,c_74]) ).
cnf(c_711,plain,
~ is_a_theorem(implies(implies(X0,a),sP1_iProver_def)),
inference(superposition,[status(thm)],[c_50,c_702]) ).
cnf(c_808,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X2,X0))
| is_a_theorem(implies(X2,X1)) ),
inference(superposition,[status(thm)],[c_180,c_591]) ).
cnf(c_1447,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_808]) ).
cnf(c_2277,plain,
is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(superposition,[status(thm)],[c_50,c_1447]) ).
cnf(c_2387,plain,
is_a_theorem(implies(sP0_iProver_def,implies(a,X0))),
inference(superposition,[status(thm)],[c_71,c_2277]) ).
cnf(c_2559,plain,
is_a_theorem(implies(implies(sP0_iProver_def,a),sP1_iProver_def)),
inference(superposition,[status(thm)],[c_2387,c_531]) ).
cnf(c_2561,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2559,c_711]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL066-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n016.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 May 2 19:30:00 EDT 2024
% 0.20/0.35 % 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.91/1.16 % SZS status Started for theBenchmark.p
% 3.91/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.91/1.16
% 3.91/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.91/1.16
% 3.91/1.16 ------ iProver source info
% 3.91/1.16
% 3.91/1.16 git: date: 2024-05-02 19:28:25 +0000
% 3.91/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.91/1.16 git: non_committed_changes: false
% 3.91/1.16
% 3.91/1.16 ------ Parsing...successful
% 3.91/1.16
% 3.91/1.16
% 3.91/1.16
% 3.91/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.91/1.16
% 3.91/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.91/1.16
% 3.91/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.91/1.16 ------ Proving...
% 3.91/1.16 ------ Problem Properties
% 3.91/1.16
% 3.91/1.16
% 3.91/1.16 clauses 8
% 3.91/1.16 conjectures 1
% 3.91/1.16 EPR 1
% 3.91/1.16 Horn 8
% 3.91/1.16 unary 7
% 3.91/1.16 binary 0
% 3.91/1.16 lits 10
% 3.91/1.16 lits eq 3
% 3.91/1.16 fd_pure 0
% 3.91/1.16 fd_pseudo 0
% 3.91/1.16 fd_cond 0
% 3.91/1.16 fd_pseudo_cond 0
% 3.91/1.16 AC symbols 0
% 3.91/1.16
% 3.91/1.16 ------ Schedule dynamic 5 is on
% 3.91/1.16
% 3.91/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.91/1.16
% 3.91/1.16
% 3.91/1.16 ------
% 3.91/1.16 Current options:
% 3.91/1.16 ------
% 3.91/1.16
% 3.91/1.16
% 3.91/1.16
% 3.91/1.16
% 3.91/1.16 ------ Proving...
% 3.91/1.16
% 3.91/1.16
% 3.91/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 3.91/1.16
% 3.91/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.91/1.16
% 3.91/1.16
%------------------------------------------------------------------------------