TSTP Solution File: LCL239-10 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL239-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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:43:27 EDT 2023
% Result : Unsatisfiable 7.77s 1.68s
% Output : CNFRefutation 7.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 3 RR)
% Number of literals : 37 ( 36 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-4 aty)
% Number of variables : 64 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(c_50,plain,
axiom(implies(or(X0,X0),X0)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
cnf(c_51,plain,
axiom(implies(X0,or(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
cnf(c_52,plain,
axiom(implies(or(X0,X1),or(X1,X0))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
cnf(c_54,plain,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
cnf(c_55,plain,
or(not(X0),X1) = implies(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
cnf(c_56,plain,
ifeq(axiom(X0),true,theorem(X0),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
cnf(c_57,plain,
ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
cnf(c_58,plain,
not(or(not(X0),not(X1))) = and(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).
cnf(c_59,negated_conjecture,
theorem(not(and(p,not(p)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_11967,plain,
ifeq(true,true,theorem(implies(or(X0,X0),X0)),true) = true,
inference(superposition,[status(thm)],[c_50,c_56]) ).
cnf(c_11968,plain,
ifeq(true,true,theorem(implies(X0,or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[c_51,c_56]) ).
cnf(c_11969,plain,
ifeq(true,true,theorem(implies(or(X0,X1),or(X1,X0))),true) = true,
inference(superposition,[status(thm)],[c_52,c_56]) ).
cnf(c_11971,plain,
ifeq(true,true,theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),true) = true,
inference(superposition,[status(thm)],[c_54,c_56]) ).
cnf(c_11972,plain,
ifeq(theorem(or(not(X0),X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
inference(superposition,[status(thm)],[c_55,c_57]) ).
cnf(c_11973,plain,
theorem(not(not(or(not(p),not(not(p)))))) != true,
inference(superposition,[status(thm)],[c_58,c_59]) ).
cnf(c_11974,plain,
theorem(or(not(X0),or(X1,X0))) = true,
inference(demodulation,[status(thm)],[c_11968,c_49,c_55]) ).
cnf(c_11975,plain,
theorem(or(not(or(X0,X0)),X0)) = true,
inference(demodulation,[status(thm)],[c_11967,c_49,c_55]) ).
cnf(c_11976,plain,
theorem(or(not(or(X0,X1)),or(X1,X0))) = true,
inference(demodulation,[status(thm)],[c_11969,c_49,c_55]) ).
cnf(c_11980,plain,
theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) = true,
inference(demodulation,[status(thm)],[c_11971,c_49,c_55]) ).
cnf(c_11988,plain,
ifeq(theorem(implies(or(not(X0),or(X1,X0)),X2)),true,ifeq(true,true,theorem(X2),true),true) = true,
inference(superposition,[status(thm)],[c_11974,c_57]) ).
cnf(c_12006,plain,
ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),true) = true,
inference(superposition,[status(thm)],[c_11976,c_11972]) ).
cnf(c_12021,plain,
ifeq(true,true,ifeq(theorem(or(not(X0),X1)),true,theorem(or(not(or(X2,X0)),or(X2,X1))),true),true) = true,
inference(superposition,[status(thm)],[c_11980,c_11972]) ).
cnf(c_12024,plain,
ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true) = true,
inference(demodulation,[status(thm)],[c_12006,c_49]) ).
cnf(c_12026,plain,
ifeq(theorem(or(not(or(not(X0),or(X1,X0))),X2)),true,theorem(X2),true) = true,
inference(demodulation,[status(thm)],[c_11988,c_49,c_55]) ).
cnf(c_12031,plain,
ifeq(theorem(or(not(X0),X1)),true,theorem(or(not(or(X2,X0)),or(X2,X1))),true) = true,
inference(demodulation,[status(thm)],[c_12021,c_49]) ).
cnf(c_12114,plain,
ifeq(true,true,theorem(or(not(or(X0,or(X1,X1))),or(X0,X1))),true) = true,
inference(superposition,[status(thm)],[c_11975,c_12031]) ).
cnf(c_12163,plain,
theorem(or(not(or(X0,or(X1,X1))),or(X0,X1))) = true,
inference(demodulation,[status(thm)],[c_12114,c_49]) ).
cnf(c_12700,plain,
ifeq(true,true,theorem(or(not(X0),X0)),true) = true,
inference(superposition,[status(thm)],[c_12163,c_12026]) ).
cnf(c_13005,plain,
theorem(or(not(X0),X0)) = true,
inference(demodulation,[status(thm)],[c_12700,c_49]) ).
cnf(c_13351,plain,
ifeq(true,true,theorem(or(X0,not(X0))),true) = true,
inference(superposition,[status(thm)],[c_13005,c_12024]) ).
cnf(c_13923,plain,
theorem(or(X0,not(X0))) = true,
inference(demodulation,[status(thm)],[c_13351,c_49]) ).
cnf(c_14276,plain,
ifeq(true,true,ifeq(theorem(X0),true,theorem(not(not(X0))),true),true) = true,
inference(superposition,[status(thm)],[c_13923,c_11972]) ).
cnf(c_14898,plain,
ifeq(theorem(X0),true,theorem(not(not(X0))),true) = true,
inference(demodulation,[status(thm)],[c_14276,c_49]) ).
cnf(c_19929,plain,
ifeq(true,true,theorem(not(not(or(X0,not(X0))))),true) = true,
inference(superposition,[status(thm)],[c_13923,c_14898]) ).
cnf(c_20185,plain,
theorem(not(not(or(X0,not(X0))))) = true,
inference(demodulation,[status(thm)],[c_19929,c_49]) ).
cnf(c_20518,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_11973,c_20185]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL239-10 : TPTP v8.1.2. Released v7.5.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 25 06:05:39 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running UEQ theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.77/1.68 % SZS status Started for theBenchmark.p
% 7.77/1.68 % SZS status Unsatisfiable for theBenchmark.p
% 7.77/1.68
% 7.77/1.68 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.77/1.68
% 7.77/1.68 ------ iProver source info
% 7.77/1.68
% 7.77/1.68 git: date: 2023-05-31 18:12:56 +0000
% 7.77/1.68 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.77/1.68 git: non_committed_changes: false
% 7.77/1.68 git: last_make_outside_of_git: false
% 7.77/1.68
% 7.77/1.68 ------ Parsing...successful
% 7.77/1.68
% 7.77/1.68
% 7.77/1.68
% 7.77/1.68 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 7.77/1.68
% 7.77/1.68 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.77/1.68
% 7.77/1.68 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 7.77/1.68 ------ Proving...
% 7.77/1.68 ------ Problem Properties
% 7.77/1.68
% 7.77/1.68
% 7.77/1.68 clauses 11
% 7.77/1.68 conjectures 1
% 7.77/1.68 EPR 0
% 7.77/1.68 Horn 11
% 7.77/1.68 unary 11
% 7.77/1.68 binary 0
% 7.77/1.68 lits 11
% 7.77/1.68 lits eq 11
% 7.77/1.68 fd_pure 0
% 7.77/1.68 fd_pseudo 0
% 7.77/1.68 fd_cond 0
% 7.77/1.68 fd_pseudo_cond 0
% 7.77/1.68 AC symbols 0
% 7.77/1.68
% 7.77/1.68 ------ Input Options Time Limit: Unbounded
% 7.77/1.68
% 7.77/1.68
% 7.77/1.68 ------
% 7.77/1.68 Current options:
% 7.77/1.68 ------
% 7.77/1.68
% 7.77/1.68
% 7.77/1.68
% 7.77/1.68
% 7.77/1.68 ------ Proving...
% 7.77/1.68
% 7.77/1.68
% 7.77/1.68 % SZS status Unsatisfiable for theBenchmark.p
% 7.77/1.68
% 7.77/1.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.77/1.68
% 7.77/1.68
%------------------------------------------------------------------------------