↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL155-1 : 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 : n013.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:32 PM UTC 2026

% Result   : Unsatisfiable 1.28s 1.73s
% Output   : CNFRefutation 1.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   36 (  36 unt;   0 nHn;   6 RR)
%            Number of literals    :   36 (  35 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    :    9 (   9 usr;   3 con; 0-2 aty)
%            Number of variables   :   53 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
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(or_definition,axiom,
    or(X1,X2) = implies(not(X1),X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',or_definition) ).

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(false_definition,axiom,
    not(truth) = falsehood,
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',false_definition) ).

cnf(and_star_definition,axiom,
    and_star(X1,X2) = not(or(not(X1),not(X2))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',and_star_definition) ).

cnf(and_definition,axiom,
    and(X1,X2) = not(or(not(X1),not(X2))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',and_definition) ).

cnf(or_commutativity,axiom,
    or(X1,X2) = or(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',or_commutativity) ).

cnf(xor_definition,axiom,
    xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',xor_definition) ).

cnf(and_star_commutativity,axiom,
    and_star(X1,X2) = and_star(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',and_star_commutativity) ).

cnf(prove_alternative_wajsberg_axiom,negated_conjecture,
    xor(x,x) != falsehood,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).

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

cnf(c_0_12,axiom,
    or(X1,X2) = implies(not(X1),X2),
    or_definition ).

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

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

cnf(c_0_15,plain,
    implies(or(X1,not(X2)),implies(X2,X1)) = truth,
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,axiom,
    not(truth) = falsehood,
    false_definition ).

cnf(c_0_17,plain,
    implies(X1,implies(implies(X1,X2),X2)) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).

cnf(c_0_18,axiom,
    and_star(X1,X2) = not(or(not(X1),not(X2))),
    and_star_definition ).

cnf(c_0_19,axiom,
    and(X1,X2) = not(or(not(X1),not(X2))),
    and_definition ).

cnf(c_0_20,plain,
    implies(or(X1,falsehood),X1) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_16]) ).

cnf(c_0_21,axiom,
    or(X1,X2) = or(X2,X1),
    or_commutativity ).

cnf(c_0_22,plain,
    implies(X1,X1) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_17]),c_0_14]) ).

cnf(c_0_23,plain,
    and(X1,X2) = and_star(X1,X2),
    inference(rw,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_24,plain,
    implies(or(falsehood,X1),X1) = truth,
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,plain,
    or(X1,not(X1)) = truth,
    inference(spm,[status(thm)],[c_0_12,c_0_22]) ).

cnf(c_0_26,axiom,
    xor(X1,X2) = or(and(X1,not(X2)),and(not(X1),X2)),
    xor_definition ).

cnf(c_0_27,plain,
    not(or(not(X1),not(X2))) = and_star(X1,X2),
    inference(rw,[status(thm)],[c_0_19,c_0_23]) ).

cnf(c_0_28,plain,
    not(falsehood) = truth,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_14]) ).

cnf(c_0_29,plain,
    or(and_star(X1,not(X2)),and_star(not(X1),X2)) = xor(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_23]),c_0_23]) ).

cnf(c_0_30,plain,
    and_star(X1,not(X1)) = falsehood,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_16]) ).

cnf(c_0_31,plain,
    or(falsehood,X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_28]),c_0_14]) ).

cnf(c_0_32,axiom,
    and_star(X1,X2) = and_star(X2,X1),
    and_star_commutativity ).

cnf(c_0_33,negated_conjecture,
    xor(x,x) != falsehood,
    prove_alternative_wajsberg_axiom ).

cnf(c_0_34,plain,
    xor(X1,X1) = falsehood,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_30]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL155-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12  % 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.16/0.33  % Computer : n013.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Mon May  4 22:05:11 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 1.28/1.73  % Version  : CSE_E---1.7
% 1.28/1.73  % Problem  : theBenchmark.p
% 1.28/1.73  % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.73  % SZS output start CNFRefutation
% See solution above
% 1.28/1.73  % Total time : 1.371s
%------------------------------------------------------------------------------