TSTP Solution File: GRP178-2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : GRP178-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 00:58:29 EDT 2023
% Result : Unsatisfiable 82.29s 11.21s
% Output : CNFRefutation 82.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 18
% Syntax : Number of clauses : 101 ( 101 unt; 0 nHn; 20 RR)
% Number of literals : 101 ( 100 equ; 1 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; 4 con; 0-2 aty)
% Number of variables : 136 ( 27 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
greatest_lower_bound(identity,a) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p09b_1) ).
cnf(c_51,plain,
greatest_lower_bound(identity,c) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p09b_3) ).
cnf(c_52,plain,
greatest_lower_bound(a,b) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p09b_4) ).
cnf(c_53,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p09b) ).
cnf(c_54,plain,
greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(c_55,plain,
least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(c_56,plain,
greatest_lower_bound(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(X0,greatest_lower_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(c_57,plain,
least_upper_bound(least_upper_bound(X0,X1),X2) = least_upper_bound(X0,least_upper_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(c_58,plain,
least_upper_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',idempotence_of_lub) ).
cnf(c_60,plain,
least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(c_61,plain,
greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(c_62,plain,
least_upper_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,least_upper_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(c_63,plain,
greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)) = multiply(X0,greatest_lower_bound(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
cnf(c_64,plain,
least_upper_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(least_upper_bound(X0,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(c_65,plain,
greatest_lower_bound(multiply(X0,X1),multiply(X2,X1)) = multiply(greatest_lower_bound(X0,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(c_66,plain,
multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(c_67,plain,
multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(c_68,plain,
multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(c_203,plain,
least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X1,least_upper_bound(X0,X2)),
inference(superposition,[status(thm)],[c_57,c_55]) ).
cnf(c_211,plain,
least_upper_bound(a,identity) = a,
inference(superposition,[status(thm)],[c_52,c_60]) ).
cnf(c_212,plain,
least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_54,c_60]) ).
cnf(c_215,plain,
least_upper_bound(identity,a) = a,
inference(theory_normalisation,[status(thm)],[c_211,c_56,c_54,c_57,c_55]) ).
cnf(c_216,plain,
greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_55,c_61]) ).
cnf(c_223,plain,
greatest_lower_bound(identity,greatest_lower_bound(a,X0)) = greatest_lower_bound(identity,X0),
inference(superposition,[status(thm)],[c_49,c_56]) ).
cnf(c_225,plain,
greatest_lower_bound(identity,greatest_lower_bound(c,X0)) = greatest_lower_bound(identity,X0),
inference(superposition,[status(thm)],[c_51,c_56]) ).
cnf(c_228,plain,
greatest_lower_bound(X0,greatest_lower_bound(least_upper_bound(X0,X1),X2)) = greatest_lower_bound(X0,X2),
inference(superposition,[status(thm)],[c_61,c_56]) ).
cnf(c_244,plain,
least_upper_bound(c,identity) = c,
inference(superposition,[status(thm)],[c_51,c_212]) ).
cnf(c_248,plain,
least_upper_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,X0))) = X0,
inference(superposition,[status(thm)],[c_56,c_212]) ).
cnf(c_253,plain,
least_upper_bound(identity,c) = c,
inference(theory_normalisation,[status(thm)],[c_244,c_56,c_54,c_57,c_55]) ).
cnf(c_282,plain,
least_upper_bound(X0,least_upper_bound(greatest_lower_bound(X0,X1),X2)) = least_upper_bound(X0,X2),
inference(superposition,[status(thm)],[c_60,c_57]) ).
cnf(c_286,plain,
least_upper_bound(identity,least_upper_bound(c,X0)) = least_upper_bound(c,X0),
inference(superposition,[status(thm)],[c_253,c_57]) ).
cnf(c_288,plain,
greatest_lower_bound(X0,least_upper_bound(X1,least_upper_bound(X2,X0))) = X0,
inference(superposition,[status(thm)],[c_57,c_216]) ).
cnf(c_302,plain,
multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[status(thm)],[c_67,c_68]) ).
cnf(c_356,plain,
greatest_lower_bound(identity,least_upper_bound(X0,a)) = greatest_lower_bound(identity,a),
inference(superposition,[status(thm)],[c_216,c_223]) ).
cnf(c_361,plain,
greatest_lower_bound(identity,least_upper_bound(X0,a)) = identity,
inference(light_normalisation,[status(thm)],[c_356,c_49]) ).
cnf(c_374,plain,
greatest_lower_bound(identity,greatest_lower_bound(least_upper_bound(X0,a),X1)) = greatest_lower_bound(identity,X1),
inference(superposition,[status(thm)],[c_361,c_56]) ).
cnf(c_423,plain,
least_upper_bound(X0,multiply(X1,X0)) = multiply(least_upper_bound(identity,X1),X0),
inference(superposition,[status(thm)],[c_66,c_64]) ).
cnf(c_492,plain,
greatest_lower_bound(identity,least_upper_bound(c,X0)) = greatest_lower_bound(identity,c),
inference(superposition,[status(thm)],[c_61,c_225]) ).
cnf(c_498,plain,
greatest_lower_bound(identity,least_upper_bound(c,X0)) = identity,
inference(light_normalisation,[status(thm)],[c_492,c_51]) ).
cnf(c_524,plain,
least_upper_bound(least_upper_bound(c,X0),identity) = least_upper_bound(c,X0),
inference(superposition,[status(thm)],[c_498,c_212]) ).
cnf(c_525,plain,
least_upper_bound(identity,least_upper_bound(X0,c)) = least_upper_bound(c,X0),
inference(theory_normalisation,[status(thm)],[c_524,c_56,c_54,c_57,c_55]) ).
cnf(c_639,plain,
least_upper_bound(least_upper_bound(X0,X1),greatest_lower_bound(X2,X0)) = least_upper_bound(X0,X1),
inference(superposition,[status(thm)],[c_61,c_248]) ).
cnf(c_669,plain,
least_upper_bound(X0,least_upper_bound(X1,greatest_lower_bound(X2,X0))) = least_upper_bound(X0,X1),
inference(theory_normalisation,[status(thm)],[c_639,c_56,c_54,c_57,c_55]) ).
cnf(c_824,plain,
least_upper_bound(identity,least_upper_bound(X0,c)) = least_upper_bound(X0,c),
inference(superposition,[status(thm)],[c_55,c_286]) ).
cnf(c_851,plain,
greatest_lower_bound(greatest_lower_bound(X0,X1),least_upper_bound(X2,X0)) = greatest_lower_bound(X0,X1),
inference(superposition,[status(thm)],[c_60,c_288]) ).
cnf(c_897,plain,
greatest_lower_bound(X0,greatest_lower_bound(X1,least_upper_bound(X2,X0))) = greatest_lower_bound(X0,X1),
inference(theory_normalisation,[status(thm)],[c_851,c_56,c_54,c_57,c_55]) ).
cnf(c_1154,plain,
least_upper_bound(identity,least_upper_bound(X0,least_upper_bound(X1,c))) = least_upper_bound(c,least_upper_bound(X0,X1)),
inference(superposition,[status(thm)],[c_57,c_525]) ).
cnf(c_1742,plain,
multiply(inverse(inverse(X0)),identity) = multiply(identity,X0),
inference(superposition,[status(thm)],[c_67,c_302]) ).
cnf(c_1755,plain,
multiply(inverse(inverse(X0)),identity) = X0,
inference(light_normalisation,[status(thm)],[c_1742,c_66]) ).
cnf(c_1795,plain,
multiply(inverse(inverse(X0)),multiply(identity,X1)) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_1755,c_68]) ).
cnf(c_2714,plain,
greatest_lower_bound(X0,greatest_lower_bound(X1,least_upper_bound(X0,X2))) = greatest_lower_bound(X0,X1),
inference(superposition,[status(thm)],[c_54,c_228]) ).
cnf(c_3033,plain,
least_upper_bound(X0,least_upper_bound(X1,greatest_lower_bound(X0,X2))) = least_upper_bound(X0,X1),
inference(superposition,[status(thm)],[c_55,c_282]) ).
cnf(c_4306,plain,
greatest_lower_bound(X0,multiply(least_upper_bound(identity,X1),X0)) = X0,
inference(superposition,[status(thm)],[c_423,c_61]) ).
cnf(c_4366,plain,
greatest_lower_bound(X0,multiply(a,X0)) = X0,
inference(superposition,[status(thm)],[c_215,c_4306]) ).
cnf(c_4369,plain,
greatest_lower_bound(X0,multiply(c,X0)) = X0,
inference(superposition,[status(thm)],[c_253,c_4306]) ).
cnf(c_4572,plain,
greatest_lower_bound(X0,greatest_lower_bound(multiply(a,X0),X1)) = greatest_lower_bound(X0,X1),
inference(superposition,[status(thm)],[c_4366,c_56]) ).
cnf(c_4753,plain,
greatest_lower_bound(identity,multiply(c,least_upper_bound(X0,a))) = greatest_lower_bound(identity,least_upper_bound(X0,a)),
inference(superposition,[status(thm)],[c_4369,c_374]) ).
cnf(c_4778,plain,
greatest_lower_bound(identity,multiply(c,least_upper_bound(X0,a))) = identity,
inference(light_normalisation,[status(thm)],[c_4753,c_361]) ).
cnf(c_8191,plain,
greatest_lower_bound(c,greatest_lower_bound(X0,c)) = greatest_lower_bound(c,X0),
inference(superposition,[status(thm)],[c_253,c_897]) ).
cnf(c_11553,plain,
multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
inference(superposition,[status(thm)],[c_66,c_1795]) ).
cnf(c_11573,plain,
multiply(X0,identity) = X0,
inference(demodulation,[status(thm)],[c_1755,c_11553]) ).
cnf(c_11601,plain,
greatest_lower_bound(X0,multiply(X0,X1)) = multiply(X0,greatest_lower_bound(identity,X1)),
inference(superposition,[status(thm)],[c_11573,c_63]) ).
cnf(c_11602,plain,
least_upper_bound(X0,multiply(X0,X1)) = multiply(X0,least_upper_bound(identity,X1)),
inference(superposition,[status(thm)],[c_11573,c_62]) ).
cnf(c_12228,plain,
multiply(X0,inverse(X0)) = identity,
inference(superposition,[status(thm)],[c_11553,c_67]) ).
cnf(c_12230,plain,
multiply(X0,identity) = inverse(inverse(X0)),
inference(superposition,[status(thm)],[c_11553,c_11573]) ).
cnf(c_12231,plain,
inverse(inverse(X0)) = X0,
inference(light_normalisation,[status(thm)],[c_12230,c_11573]) ).
cnf(c_13163,plain,
least_upper_bound(identity,least_upper_bound(X0,identity)) = least_upper_bound(identity,X0),
inference(superposition,[status(thm)],[c_4778,c_3033]) ).
cnf(c_24041,plain,
greatest_lower_bound(X0,multiply(X0,c)) = multiply(X0,identity),
inference(superposition,[status(thm)],[c_51,c_11601]) ).
cnf(c_24277,plain,
greatest_lower_bound(X0,multiply(X0,c)) = X0,
inference(light_normalisation,[status(thm)],[c_24041,c_11573]) ).
cnf(c_24670,plain,
greatest_lower_bound(X0,greatest_lower_bound(multiply(X0,c),X1)) = greatest_lower_bound(X0,X1),
inference(superposition,[status(thm)],[c_24277,c_56]) ).
cnf(c_25608,plain,
multiply(inverse(X0),least_upper_bound(identity,X0)) = least_upper_bound(inverse(X0),identity),
inference(superposition,[status(thm)],[c_67,c_11602]) ).
cnf(c_25617,plain,
multiply(X0,least_upper_bound(identity,inverse(X0))) = least_upper_bound(X0,identity),
inference(superposition,[status(thm)],[c_12228,c_11602]) ).
cnf(c_25688,plain,
multiply(inverse(X0),least_upper_bound(identity,X0)) = least_upper_bound(identity,inverse(X0)),
inference(theory_normalisation,[status(thm)],[c_25608,c_56,c_54,c_57,c_55]) ).
cnf(c_32299,plain,
greatest_lower_bound(c,multiply(a,c)) = greatest_lower_bound(c,c),
inference(superposition,[status(thm)],[c_8191,c_4572]) ).
cnf(c_36309,plain,
greatest_lower_bound(X0,greatest_lower_bound(X1,multiply(X0,c))) = greatest_lower_bound(X0,X1),
inference(superposition,[status(thm)],[c_54,c_24670]) ).
cnf(c_36314,plain,
greatest_lower_bound(X0,multiply(greatest_lower_bound(X0,X1),c)) = greatest_lower_bound(X0,multiply(X1,c)),
inference(superposition,[status(thm)],[c_65,c_24670]) ).
cnf(c_38859,plain,
multiply(inverse(inverse(X0)),least_upper_bound(identity,inverse(X0))) = multiply(identity,least_upper_bound(identity,X0)),
inference(superposition,[status(thm)],[c_25688,c_302]) ).
cnf(c_38878,plain,
multiply(identity,least_upper_bound(identity,X0)) = least_upper_bound(X0,identity),
inference(light_normalisation,[status(thm)],[c_38859,c_12231,c_25617]) ).
cnf(c_98823,plain,
least_upper_bound(c,least_upper_bound(least_upper_bound(X0,c),X0)) = least_upper_bound(identity,least_upper_bound(X0,c)),
inference(superposition,[status(thm)],[c_58,c_1154]) ).
cnf(c_98987,plain,
least_upper_bound(c,least_upper_bound(X0,least_upper_bound(c,X0))) = least_upper_bound(identity,least_upper_bound(X0,c)),
inference(theory_normalisation,[status(thm)],[c_98823,c_56,c_54,c_57,c_55]) ).
cnf(c_98988,plain,
least_upper_bound(c,least_upper_bound(X0,least_upper_bound(c,X0))) = least_upper_bound(X0,c),
inference(light_normalisation,[status(thm)],[c_98987,c_824]) ).
cnf(c_99233,plain,
least_upper_bound(c,least_upper_bound(c,least_upper_bound(X0,X0))) = least_upper_bound(X0,c),
inference(superposition,[status(thm)],[c_203,c_98988]) ).
cnf(c_99235,plain,
least_upper_bound(c,least_upper_bound(identity,c)) = least_upper_bound(identity,c),
inference(superposition,[status(thm)],[c_13163,c_98988]) ).
cnf(c_99381,plain,
least_upper_bound(identity,least_upper_bound(c,c)) = least_upper_bound(identity,c),
inference(theory_normalisation,[status(thm)],[c_99235,c_56,c_54,c_57,c_55]) ).
cnf(c_99382,plain,
least_upper_bound(identity,least_upper_bound(c,c)) = c,
inference(light_normalisation,[status(thm)],[c_99381,c_253]) ).
cnf(c_99388,plain,
least_upper_bound(c,least_upper_bound(c,X0)) = least_upper_bound(X0,c),
inference(light_normalisation,[status(thm)],[c_99233,c_58]) ).
cnf(c_99550,plain,
greatest_lower_bound(least_upper_bound(c,c),c) = least_upper_bound(c,c),
inference(superposition,[status(thm)],[c_99382,c_216]) ).
cnf(c_99597,plain,
greatest_lower_bound(c,least_upper_bound(c,c)) = least_upper_bound(c,c),
inference(theory_normalisation,[status(thm)],[c_99550,c_56,c_54,c_57,c_55]) ).
cnf(c_111972,plain,
greatest_lower_bound(a,greatest_lower_bound(c,c)) = greatest_lower_bound(a,c),
inference(superposition,[status(thm)],[c_32299,c_36309]) ).
cnf(c_136935,plain,
multiply(identity,least_upper_bound(c,X0)) = least_upper_bound(least_upper_bound(X0,c),identity),
inference(superposition,[status(thm)],[c_525,c_38878]) ).
cnf(c_137097,plain,
multiply(identity,least_upper_bound(c,X0)) = least_upper_bound(X0,least_upper_bound(identity,c)),
inference(theory_normalisation,[status(thm)],[c_136935,c_56,c_54,c_57,c_55]) ).
cnf(c_137098,plain,
multiply(identity,least_upper_bound(c,X0)) = least_upper_bound(X0,c),
inference(light_normalisation,[status(thm)],[c_137097,c_253]) ).
cnf(c_206447,plain,
least_upper_bound(greatest_lower_bound(X0,c),c) = least_upper_bound(c,c),
inference(superposition,[status(thm)],[c_99388,c_669]) ).
cnf(c_206537,plain,
least_upper_bound(c,greatest_lower_bound(X0,c)) = least_upper_bound(c,c),
inference(theory_normalisation,[status(thm)],[c_206447,c_56,c_54,c_57,c_55]) ).
cnf(c_206775,plain,
greatest_lower_bound(c,c) = least_upper_bound(c,c),
inference(superposition,[status(thm)],[c_99597,c_2714]) ).
cnf(c_212597,plain,
least_upper_bound(greatest_lower_bound(X0,c),c) = multiply(identity,c),
inference(superposition,[status(thm)],[c_212,c_137098]) ).
cnf(c_212697,plain,
least_upper_bound(c,greatest_lower_bound(X0,c)) = multiply(identity,c),
inference(theory_normalisation,[status(thm)],[c_212597,c_56,c_54,c_57,c_55]) ).
cnf(c_212698,plain,
greatest_lower_bound(c,c) = multiply(identity,c),
inference(light_normalisation,[status(thm)],[c_212697,c_206537,c_206775]) ).
cnf(c_254849,plain,
greatest_lower_bound(a,multiply(identity,c)) = greatest_lower_bound(a,multiply(b,c)),
inference(superposition,[status(thm)],[c_52,c_36314]) ).
cnf(c_255757,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c),
inference(light_normalisation,[status(thm)],[c_254849,c_111972,c_212698]) ).
cnf(c_255758,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_255757,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP178-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n009.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 : Mon Aug 28 20:23:20 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.20/0.50 Running UEQ theorem proving
% 0.20/0.50 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 82.29/11.21 % SZS status Started for theBenchmark.p
% 82.29/11.21 % SZS status Unsatisfiable for theBenchmark.p
% 82.29/11.21
% 82.29/11.21 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 82.29/11.21
% 82.29/11.21 ------ iProver source info
% 82.29/11.21
% 82.29/11.21 git: date: 2023-05-31 18:12:56 +0000
% 82.29/11.21 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 82.29/11.21 git: non_committed_changes: false
% 82.29/11.21 git: last_make_outside_of_git: false
% 82.29/11.21
% 82.29/11.21 ------ Parsing...successful
% 82.29/11.21
% 82.29/11.21
% 82.29/11.21
% 82.29/11.21 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 82.29/11.21
% 82.29/11.21 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 82.29/11.21
% 82.29/11.21 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 82.29/11.21 ------ Proving...
% 82.29/11.21 ------ Problem Properties
% 82.29/11.21
% 82.29/11.21
% 82.29/11.21 clauses 20
% 82.29/11.21 conjectures 1
% 82.29/11.21 EPR 0
% 82.29/11.21 Horn 20
% 82.29/11.21 unary 20
% 82.29/11.21 binary 0
% 82.29/11.21 lits 20
% 82.29/11.21 lits eq 20
% 82.29/11.21 fd_pure 0
% 82.29/11.21 fd_pseudo 0
% 82.29/11.21 fd_cond 0
% 82.29/11.21 fd_pseudo_cond 0
% 82.29/11.21 AC symbols 2
% 82.29/11.21
% 82.29/11.21 ------ Input Options Time Limit: Unbounded
% 82.29/11.21
% 82.29/11.21
% 82.29/11.21 ------
% 82.29/11.21 Current options:
% 82.29/11.21 ------
% 82.29/11.21
% 82.29/11.21
% 82.29/11.21
% 82.29/11.21
% 82.29/11.21 ------ Proving...
% 82.29/11.21
% 82.29/11.21
% 82.29/11.21 % SZS status Unsatisfiable for theBenchmark.p
% 82.29/11.21
% 82.29/11.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 82.29/11.21
% 82.29/11.21
%------------------------------------------------------------------------------