TSTP Solution File: LCL158-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL158-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:37:01 EDT 2024
% Result : Unsatisfiable 3.49s 1.12s
% Output : CNFRefutation 3.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 16
% Syntax : Number of clauses : 65 ( 65 unt; 0 nHn; 11 RR)
% Number of literals : 65 ( 64 equ; 4 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 : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 75 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
and_star(xor(truth,x),x) != falsehood,
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL002-1.ax',xor_definition) ).
cnf(c_52,plain,
not(or(not(X0),not(X1))) = and_star(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',and_star_definition) ).
cnf(c_53,plain,
and_star(and_star(X0,X1),X2) = and_star(X0,and_star(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',and_star_associativity) ).
cnf(c_54,plain,
and_star(X0,X1) = and_star(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',and_star_commutativity) ).
cnf(c_55,plain,
not(truth) = falsehood,
file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',false_definition) ).
cnf(c_56,plain,
implies(not(X0),X1) = or(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_definition) ).
cnf(c_57,plain,
or(or(X0,X1),X2) = or(X0,or(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_associativity) ).
cnf(c_58,plain,
or(X0,X1) = or(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_commutativity) ).
cnf(c_59,plain,
not(or(not(X0),not(X1))) = and(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',and_definition) ).
cnf(c_60,plain,
and(and(X0,X1),X2) = and(X0,and(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',and_associativity) ).
cnf(c_61,plain,
and(X0,X1) = and(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',and_commutativity) ).
cnf(c_62,plain,
implies(truth,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(c_63,plain,
implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
cnf(c_64,plain,
implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
cnf(c_65,plain,
implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
cnf(c_81,negated_conjecture,
and_star(x,xor(truth,x)) != falsehood,
inference(theory_normalisation,[status(thm)],[c_49,c_57,c_58,c_60,c_61,c_53,c_54]) ).
cnf(c_116,plain,
and_star(X0,X1) = and(X0,X1),
inference(light_normalisation,[status(thm)],[c_52,c_59]) ).
cnf(c_118,plain,
and(x,xor(truth,x)) != falsehood,
inference(demodulation,[status(thm)],[c_81,c_116]) ).
cnf(c_120,plain,
implies(or(X0,not(X1)),implies(X1,X0)) = truth,
inference(demodulation,[status(thm)],[c_65,c_56]) ).
cnf(c_251,plain,
or(truth,X0) = implies(falsehood,X0),
inference(superposition,[status(thm)],[c_55,c_56]) ).
cnf(c_257,plain,
implies(or(X0,not(truth)),X0) = truth,
inference(superposition,[status(thm)],[c_62,c_120]) ).
cnf(c_260,plain,
implies(or(X0,falsehood),X0) = truth,
inference(light_normalisation,[status(thm)],[c_257,c_55]) ).
cnf(c_269,plain,
not(or(falsehood,not(X0))) = and(truth,X0),
inference(superposition,[status(thm)],[c_55,c_59]) ).
cnf(c_288,plain,
implies(implies(X0,truth),truth) = implies(X0,X0),
inference(superposition,[status(thm)],[c_62,c_64]) ).
cnf(c_297,plain,
or(X0,truth) = implies(falsehood,X0),
inference(superposition,[status(thm)],[c_251,c_58]) ).
cnf(c_304,plain,
implies(or(falsehood,X0),X0) = truth,
inference(superposition,[status(thm)],[c_58,c_260]) ).
cnf(c_305,plain,
implies(implies(falsehood,falsehood),truth) = truth,
inference(superposition,[status(thm)],[c_251,c_260]) ).
cnf(c_402,plain,
implies(not(X0),not(X0)) = implies(or(X0,truth),truth),
inference(superposition,[status(thm)],[c_56,c_288]) ).
cnf(c_420,plain,
implies(not(X0),not(X0)) = implies(implies(falsehood,X0),truth),
inference(light_normalisation,[status(thm)],[c_402,c_297]) ).
cnf(c_422,plain,
implies(not(falsehood),not(falsehood)) = truth,
inference(demodulation,[status(thm)],[c_305,c_420]) ).
cnf(c_440,plain,
or(falsehood,not(falsehood)) = truth,
inference(demodulation,[status(thm)],[c_422,c_56]) ).
cnf(c_445,plain,
implies(truth,not(falsehood)) = truth,
inference(superposition,[status(thm)],[c_440,c_304]) ).
cnf(c_463,plain,
not(falsehood) = truth,
inference(demodulation,[status(thm)],[c_445,c_62]) ).
cnf(c_470,plain,
not(or(truth,not(X0))) = and(falsehood,X0),
inference(superposition,[status(thm)],[c_463,c_59]) ).
cnf(c_471,plain,
or(falsehood,X0) = implies(truth,X0),
inference(superposition,[status(thm)],[c_463,c_56]) ).
cnf(c_472,plain,
or(falsehood,X0) = X0,
inference(light_normalisation,[status(thm)],[c_471,c_62]) ).
cnf(c_479,plain,
implies(X0,X0) = truth,
inference(demodulation,[status(thm)],[c_304,c_472]) ).
cnf(c_482,plain,
not(not(X0)) = and(truth,X0),
inference(demodulation,[status(thm)],[c_269,c_472]) ).
cnf(c_486,plain,
implies(implies(X0,truth),truth) = truth,
inference(demodulation,[status(thm)],[c_288,c_479]) ).
cnf(c_604,plain,
implies(implies(truth,X0),implies(implies(X0,X1),X1)) = truth,
inference(superposition,[status(thm)],[c_62,c_63]) ).
cnf(c_619,plain,
implies(X0,implies(implies(X0,X1),X1)) = truth,
inference(light_normalisation,[status(thm)],[c_604,c_62]) ).
cnf(c_683,plain,
or(X0,falsehood) = X0,
inference(superposition,[status(thm)],[c_472,c_58]) ).
cnf(c_697,plain,
or(X0,not(X0)) = truth,
inference(superposition,[status(thm)],[c_56,c_479]) ).
cnf(c_743,plain,
and(X0,not(X0)) = not(truth),
inference(superposition,[status(thm)],[c_697,c_59]) ).
cnf(c_754,plain,
and(X0,not(X0)) = falsehood,
inference(light_normalisation,[status(thm)],[c_743,c_55]) ).
cnf(c_1082,plain,
not(implies(falsehood,not(X0))) = and(falsehood,X0),
inference(demodulation,[status(thm)],[c_470,c_251]) ).
cnf(c_1261,plain,
implies(X0,truth) = truth,
inference(superposition,[status(thm)],[c_486,c_619]) ).
cnf(c_1347,plain,
or(X0,truth) = truth,
inference(superposition,[status(thm)],[c_1261,c_56]) ).
cnf(c_1367,plain,
implies(falsehood,X0) = truth,
inference(demodulation,[status(thm)],[c_297,c_1347]) ).
cnf(c_1369,plain,
and(falsehood,X0) = not(truth),
inference(demodulation,[status(thm)],[c_1082,c_1367]) ).
cnf(c_1370,plain,
and(falsehood,X0) = falsehood,
inference(light_normalisation,[status(thm)],[c_1369,c_55]) ).
cnf(c_1402,plain,
implies(implies(X0,falsehood),falsehood) = implies(truth,X0),
inference(superposition,[status(thm)],[c_1367,c_64]) ).
cnf(c_1408,plain,
implies(implies(X0,falsehood),falsehood) = X0,
inference(light_normalisation,[status(thm)],[c_1402,c_62]) ).
cnf(c_1465,plain,
implies(or(X0,falsehood),falsehood) = not(X0),
inference(superposition,[status(thm)],[c_56,c_1408]) ).
cnf(c_1485,plain,
implies(X0,falsehood) = not(X0),
inference(light_normalisation,[status(thm)],[c_1465,c_683]) ).
cnf(c_1512,plain,
not(not(X0)) = or(X0,falsehood),
inference(superposition,[status(thm)],[c_1485,c_56]) ).
cnf(c_1527,plain,
not(not(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_1512,c_683]) ).
cnf(c_1538,plain,
and(truth,X0) = X0,
inference(demodulation,[status(thm)],[c_482,c_1527]) ).
cnf(c_1620,plain,
or(not(X0),and(not(truth),X0)) = xor(truth,X0),
inference(superposition,[status(thm)],[c_1538,c_50]) ).
cnf(c_1625,plain,
or(not(X0),falsehood) = xor(truth,X0),
inference(light_normalisation,[status(thm)],[c_1620,c_55,c_1370]) ).
cnf(c_1626,plain,
or(falsehood,not(X0)) = xor(truth,X0),
inference(theory_normalisation,[status(thm)],[c_1625,c_60,c_61,c_57,c_58]) ).
cnf(c_1689,plain,
xor(truth,X0) = not(X0),
inference(demodulation,[status(thm)],[c_1626,c_472]) ).
cnf(c_1690,plain,
and(x,not(x)) != falsehood,
inference(demodulation,[status(thm)],[c_118,c_1689]) ).
cnf(c_1691,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1690,c_754]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL158-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n002.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 19:14:27 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running UEQ theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.49/1.12 % SZS status Started for theBenchmark.p
% 3.49/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.49/1.12
% 3.49/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.49/1.12
% 3.49/1.12 ------ iProver source info
% 3.49/1.12
% 3.49/1.12 git: date: 2024-05-02 19:28:25 +0000
% 3.49/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.49/1.12 git: non_committed_changes: false
% 3.49/1.12
% 3.49/1.12 ------ Parsing...successful
% 3.49/1.12
% 3.49/1.12
% 3.49/1.12
% 3.49/1.12 ------ Preprocessing... sup_sim: 6 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
% 3.49/1.12
% 3.49/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.49/1.12
% 3.49/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.49/1.12 ------ Proving...
% 3.49/1.12 ------ Problem Properties
% 3.49/1.12
% 3.49/1.12
% 3.49/1.12 clauses 15
% 3.49/1.12 conjectures 0
% 3.49/1.12 EPR 0
% 3.49/1.12 Horn 15
% 3.49/1.12 unary 15
% 3.49/1.12 binary 0
% 3.49/1.12 lits 15
% 3.49/1.12 lits eq 15
% 3.49/1.12 fd_pure 0
% 3.49/1.12 fd_pseudo 0
% 3.49/1.12 fd_cond 0
% 3.49/1.12 fd_pseudo_cond 0
% 3.49/1.12 AC symbols 2
% 3.49/1.12
% 3.49/1.12 ------ Input Options Time Limit: Unbounded
% 3.49/1.12
% 3.49/1.12
% 3.49/1.12 ------
% 3.49/1.12 Current options:
% 3.49/1.12 ------
% 3.49/1.12
% 3.49/1.12
% 3.49/1.12
% 3.49/1.12
% 3.49/1.12 ------ Proving...
% 3.49/1.12
% 3.49/1.12
% 3.49/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.49/1.12
% 3.49/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.49/1.12
% 3.49/1.12
%------------------------------------------------------------------------------