↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL109-2 : TPTP v9.2.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n023.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 : Tue May  5 04:39:25 PM UTC 2026

% Result   : Unsatisfiable 3.90s 3.23s
% Output   : CNFRefutation 3.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   47 (  47 unt;   0 nHn;   4 RR)
%            Number of literals    :   47 (  46 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   82 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(wajsberg_2,axiom,
    implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).

cnf(wajsberg_1,axiom,
    implies(truth,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).

cnf(wajsberg_3,axiom,
    implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).

cnf(wajsberg_4,axiom,
    implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).

cnf(prove_wajsberg_mv_4,negated_conjecture,
    implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wajsberg_mv_4) ).

cnf(c_0_5,axiom,
    implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))) = truth,
    wajsberg_2 ).

cnf(c_0_6,axiom,
    implies(truth,X1) = X1,
    wajsberg_1 ).

cnf(c_0_7,axiom,
    implies(implies(X1,X2),X2) = implies(implies(X2,X1),X1),
    wajsberg_3 ).

cnf(c_0_8,plain,
    implies(X1,implies(implies(X1,X2),X2)) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).

cnf(c_0_9,plain,
    implies(implies(X1,truth),truth) = implies(X1,X1),
    inference(spm,[status(thm)],[c_0_7,c_0_6]) ).

cnf(c_0_10,plain,
    implies(X1,X1) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_8]),c_0_6]) ).

cnf(c_0_11,plain,
    implies(implies(X1,truth),truth) = truth,
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,plain,
    implies(X1,truth) = truth,
    inference(spm,[status(thm)],[c_0_8,c_0_11]) ).

cnf(c_0_13,plain,
    implies(X1,implies(X2,X1)) = truth,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_12]),c_0_6]),c_0_6]) ).

cnf(c_0_14,axiom,
    implies(implies(not(X1),not(X2)),implies(X2,X1)) = truth,
    wajsberg_4 ).

cnf(c_0_15,plain,
    implies(implies(implies(X1,X2),X3),implies(X2,X3)) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_6]) ).

cnf(c_0_16,plain,
    implies(implies(not(X1),not(truth)),X1) = truth,
    inference(spm,[status(thm)],[c_0_14,c_0_6]) ).

cnf(c_0_17,plain,
    implies(not(truth),X1) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_6]) ).

cnf(c_0_18,plain,
    implies(not(X1),implies(X1,X2)) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_6]) ).

cnf(c_0_19,plain,
    implies(implies(X1,not(truth)),not(truth)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_17]),c_0_6]) ).

cnf(c_0_20,plain,
    implies(not(implies(X1,not(truth))),X1) = truth,
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_21,plain,
    implies(X1,implies(not(X1),not(truth))) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_6]) ).

cnf(c_0_22,plain,
    implies(not(X1),not(truth)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_21]),c_0_6]),c_0_16]),c_0_6]) ).

cnf(c_0_23,plain,
    implies(X1,not(truth)) = not(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_22]),c_0_17]),c_0_6]) ).

cnf(c_0_24,plain,
    implies(implies(X1,X2),implies(not(X2),not(X1))) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_23]),c_0_23]) ).

cnf(c_0_25,plain,
    implies(implies(implies(implies(X1,X2),implies(X3,X2)),X4),implies(implies(X3,X1),X4)) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_5]),c_0_6]) ).

cnf(c_0_26,plain,
    implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3)) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_8]),c_0_6]) ).

cnf(c_0_27,plain,
    implies(not(X1),not(X2)) = implies(X2,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_24]),c_0_6]),c_0_14]),c_0_6]) ).

cnf(c_0_28,plain,
    not(not(X1)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_23]),c_0_23]) ).

cnf(c_0_29,plain,
    implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3))) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_6]) ).

cnf(c_0_30,plain,
    implies(implies(implies(X1,X2),X2),X2) = implies(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_6]) ).

cnf(c_0_31,plain,
    implies(not(X1),X2) = implies(not(X2),X1),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_32,plain,
    implies(X1,implies(X2,X3)) = implies(X2,implies(X1,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_29]),c_0_6]),c_0_29]),c_0_6]) ).

cnf(c_0_33,plain,
    implies(implies(implies(X1,X2),X2),X1) = implies(X2,X1),
    inference(spm,[status(thm)],[c_0_30,c_0_7]) ).

cnf(c_0_34,plain,
    implies(X1,not(X2)) = implies(X2,not(X1)),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_35,plain,
    implies(not(implies(X1,X2)),not(X2)) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_23]),c_0_23]) ).

cnf(c_0_36,plain,
    implies(X1,implies(not(X1),X2)) = truth,
    inference(spm,[status(thm)],[c_0_18,c_0_28]) ).

cnf(c_0_37,plain,
    implies(not(implies(X1,X2)),X3) = implies(X1,implies(not(X3),X2)),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_38,plain,
    implies(X1,not(implies(X2,not(implies(X2,X1))))) = implies(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_27]),c_0_27]),c_0_34]),c_0_34]) ).

cnf(c_0_39,plain,
    implies(not(implies(X1,not(X2))),X2) = truth,
    inference(spm,[status(thm)],[c_0_35,c_0_28]) ).

cnf(c_0_40,plain,
    implies(implies(implies(not(X1),X2),X1),X1) = implies(not(X1),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_36]),c_0_6]) ).

cnf(c_0_41,negated_conjecture,
    implies(implies(implies(a,b),implies(b,a)),implies(b,a)) != truth,
    prove_wajsberg_mv_4 ).

cnf(c_0_42,plain,
    implies(X1,implies(implies(X2,not(implies(X2,X1))),X3)) = implies(X1,implies(not(X3),X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_37]),c_0_27]) ).

cnf(c_0_43,plain,
    implies(not(implies(X1,X2)),X1) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_28]) ).

cnf(c_0_44,negated_conjecture,
    implies(b,implies(implies(b,implies(implies(a,b),a)),a)) != truth,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_32]),c_0_32]) ).

cnf(c_0_45,plain,
    implies(X1,implies(implies(X2,X1),X2)) = implies(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_7]),c_0_43]),c_0_6]),c_0_28]) ).

cnf(c_0_46,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_7]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : LCL109-2 : TPTP v9.2.1. Released v1.0.0.
% 0.11/0.13  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.34  % Computer : n023.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon May  4 22:00:53 EDT 2026
% 0.14/0.34  % CPUTime    : 
% 0.14/0.35  % start to proof: theBenchmark
% 3.90/3.23  % Version  : CSE_E---1.7
% 3.90/3.23  % Problem  : theBenchmark.p
% 3.90/3.23  % SZS status Unsatisfiable for theBenchmark.p
% 3.90/3.23  % SZS output start CNFRefutation
% See solution above
% 3.90/3.24  % Total time : 2.369s
%------------------------------------------------------------------------------