TSTP Solution File: LCL155-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL155-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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 : Mon Jun 24 11:04:23 EDT 2024
% Result : Unsatisfiable 2.25s 1.14s
% Output : CNFRefutation 2.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 12
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 9 RR)
% Number of literals : 37 ( 36 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
xor(x,x) != falsehood,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).
cnf(c_50,plain,
or(and(X0,not(X1)),and(not(X0),X1)) = xor(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',xor_definition) ).
cnf(c_55,plain,
not(truth) = falsehood,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',false_definition) ).
cnf(c_56,plain,
implies(not(X0),X1) = or(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',or_definition) ).
cnf(c_57,plain,
or(or(X0,X1),X2) = or(X0,or(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',or_associativity) ).
cnf(c_58,plain,
or(X0,X1) = or(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',or_commutativity) ).
cnf(c_59,plain,
not(or(not(X0),not(X1))) = and(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',and_definition) ).
cnf(c_60,plain,
and(and(X0,X1),X2) = and(X0,and(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',and_associativity) ).
cnf(c_61,plain,
and(X0,X1) = and(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',and_commutativity) ).
cnf(c_62,plain,
implies(truth,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(c_64,plain,
implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
cnf(c_65,plain,
implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
cnf(c_117,plain,
implies(or(X0,not(X1)),implies(X1,X0)) = truth,
inference(demodulation,[status(thm)],[c_65,c_56]) ).
cnf(c_247,plain,
or(truth,X0) = implies(falsehood,X0),
inference(superposition,[status(thm)],[c_55,c_56]) ).
cnf(c_249,plain,
or(X0,truth) = implies(falsehood,X0),
inference(superposition,[status(thm)],[c_58,c_247]) ).
cnf(c_274,plain,
implies(or(X0,not(truth)),X0) = truth,
inference(superposition,[status(thm)],[c_62,c_117]) ).
cnf(c_277,plain,
implies(or(X0,falsehood),X0) = truth,
inference(light_normalisation,[status(thm)],[c_274,c_55]) ).
cnf(c_299,plain,
implies(or(falsehood,X0),X0) = truth,
inference(superposition,[status(thm)],[c_58,c_277]) ).
cnf(c_300,plain,
implies(implies(falsehood,falsehood),truth) = truth,
inference(superposition,[status(thm)],[c_247,c_277]) ).
cnf(c_516,plain,
implies(implies(X0,truth),truth) = implies(X0,X0),
inference(superposition,[status(thm)],[c_62,c_64]) ).
cnf(c_771,plain,
implies(not(X0),not(X0)) = implies(or(X0,truth),truth),
inference(superposition,[status(thm)],[c_56,c_516]) ).
cnf(c_797,plain,
implies(not(X0),not(X0)) = implies(implies(falsehood,X0),truth),
inference(light_normalisation,[status(thm)],[c_771,c_249]) ).
cnf(c_801,plain,
implies(not(falsehood),not(falsehood)) = truth,
inference(demodulation,[status(thm)],[c_300,c_797]) ).
cnf(c_841,plain,
or(falsehood,not(falsehood)) = truth,
inference(demodulation,[status(thm)],[c_801,c_56]) ).
cnf(c_846,plain,
implies(truth,not(falsehood)) = truth,
inference(superposition,[status(thm)],[c_841,c_299]) ).
cnf(c_864,plain,
not(falsehood) = truth,
inference(demodulation,[status(thm)],[c_846,c_62]) ).
cnf(c_876,plain,
or(falsehood,X0) = implies(truth,X0),
inference(superposition,[status(thm)],[c_864,c_56]) ).
cnf(c_877,plain,
or(falsehood,X0) = X0,
inference(light_normalisation,[status(thm)],[c_876,c_62]) ).
cnf(c_887,plain,
implies(X0,X0) = truth,
inference(demodulation,[status(thm)],[c_299,c_877]) ).
cnf(c_937,plain,
or(X0,not(X0)) = truth,
inference(superposition,[status(thm)],[c_56,c_887]) ).
cnf(c_987,plain,
and(X0,not(X0)) = not(truth),
inference(superposition,[status(thm)],[c_937,c_59]) ).
cnf(c_997,plain,
and(X0,not(X0)) = falsehood,
inference(light_normalisation,[status(thm)],[c_987,c_55]) ).
cnf(c_1012,plain,
or(falsehood,and(not(X0),X0)) = xor(X0,X0),
inference(superposition,[status(thm)],[c_997,c_50]) ).
cnf(c_1017,plain,
or(falsehood,and(X0,not(X0))) = xor(X0,X0),
inference(theory_normalisation,[status(thm)],[c_1012,c_60,c_61,c_57,c_58]) ).
cnf(c_1018,plain,
xor(X0,X0) = or(falsehood,falsehood),
inference(light_normalisation,[status(thm)],[c_1017,c_997]) ).
cnf(c_1021,plain,
or(falsehood,falsehood) != falsehood,
inference(demodulation,[status(thm)],[c_49,c_1018]) ).
cnf(c_1022,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1021,c_877]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL155-1 : TPTP v8.2.0. Released v1.0.0.
% 0.04/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Jun 22 15:39:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running UEQ theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_j12_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.25/1.14 % SZS status Started for theBenchmark.p
% 2.25/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 2.25/1.14
% 2.25/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.25/1.14
% 2.25/1.14 ------ iProver source info
% 2.25/1.14
% 2.25/1.14 git: date: 2024-06-12 09:56:46 +0000
% 2.25/1.14 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 2.25/1.14 git: non_committed_changes: false
% 2.25/1.14
% 2.25/1.14 ------ Parsing...successful
% 2.25/1.14
% 2.25/1.14
% 2.25/1.14
% 2.25/1.14 ------ Preprocessing... sup_sim: 5 sf_s rm: 0 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.25/1.14
% 2.25/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.25/1.14
% 2.25/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.25/1.14 ------ Proving...
% 2.25/1.14 ------ Problem Properties
% 2.25/1.14
% 2.25/1.14
% 2.25/1.14 clauses 15
% 2.25/1.14 conjectures 1
% 2.25/1.14 EPR 0
% 2.25/1.14 Horn 15
% 2.25/1.14 unary 15
% 2.25/1.14 binary 0
% 2.25/1.14 lits 15
% 2.25/1.14 lits eq 15
% 2.25/1.14 fd_pure 0
% 2.25/1.14 fd_pseudo 0
% 2.25/1.14 fd_cond 0
% 2.25/1.14 fd_pseudo_cond 0
% 2.25/1.14 AC symbols 2
% 2.25/1.14
% 2.25/1.14 ------ Input Options Time Limit: Unbounded
% 2.25/1.14
% 2.25/1.14
% 2.25/1.14 ------
% 2.25/1.14 Current options:
% 2.25/1.14 ------
% 2.25/1.14
% 2.25/1.14
% 2.25/1.14
% 2.25/1.14
% 2.25/1.14 ------ Proving...
% 2.25/1.14
% 2.25/1.14
% 2.25/1.14 % SZS status Unsatisfiable for theBenchmark.p
% 2.25/1.14
% 2.25/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.25/1.14
% 2.25/1.14
%------------------------------------------------------------------------------