↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : REL009-1 : TPTP v9.2.1. Released v4.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 : n017.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 05:04:13 PM UTC 2026

% Result   : Unsatisfiable 3.71s 3.19s
% Output   : CNFRefutation 3.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   20 (  18 unt;   0 nHn;   6 RR)
%            Number of literals    :   22 (  21 equ;   5 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   30 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
    converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).

cnf(composition_distributivity_7,axiom,
    composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).

cnf(converse_additivity_9,axiom,
    converse(join(X1,X2)) = join(converse(X1),converse(X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).

cnf(converse_idempotence_8,axiom,
    converse(converse(X1)) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).

cnf(goals_14,negated_conjecture,
    join(sk1,sk2) = sk2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14) ).

cnf(goals_15,negated_conjecture,
    ( join(composition(sk1,sk3),composition(sk2,sk3)) != composition(sk2,sk3)
    | join(composition(sk3,sk1),composition(sk3,sk2)) != composition(sk3,sk2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_15) ).

cnf(c_0_6,axiom,
    converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
    converse_multiplicativity_10 ).

cnf(c_0_7,axiom,
    composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
    composition_distributivity_7 ).

cnf(c_0_8,axiom,
    converse(join(X1,X2)) = join(converse(X1),converse(X2)),
    converse_additivity_9 ).

cnf(c_0_9,plain,
    composition(converse(X1),join(converse(X2),converse(X3))) = join(composition(converse(X1),converse(X2)),composition(converse(X1),converse(X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_6]),c_0_6]),c_0_8]) ).

cnf(c_0_10,axiom,
    converse(converse(X1)) = X1,
    converse_idempotence_8 ).

cnf(c_0_11,plain,
    composition(X1,join(converse(X2),converse(X3))) = join(composition(X1,converse(X2)),composition(X1,converse(X3))),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,negated_conjecture,
    join(sk1,sk2) = sk2,
    goals_14 ).

cnf(c_0_13,plain,
    composition(X1,join(converse(X2),X3)) = join(composition(X1,converse(X2)),composition(X1,X3)),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    ( join(composition(sk1,sk3),composition(sk2,sk3)) != composition(sk2,sk3)
    | join(composition(sk3,sk1),composition(sk3,sk2)) != composition(sk3,sk2) ),
    goals_15 ).

cnf(c_0_15,negated_conjecture,
    join(composition(sk1,X1),composition(sk2,X1)) = composition(sk2,X1),
    inference(spm,[status(thm)],[c_0_7,c_0_12]) ).

cnf(c_0_16,plain,
    composition(X1,join(X2,X3)) = join(composition(X1,X2),composition(X1,X3)),
    inference(spm,[status(thm)],[c_0_13,c_0_10]) ).

cnf(c_0_17,negated_conjecture,
    join(composition(sk3,sk1),composition(sk3,sk2)) != composition(sk3,sk2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).

cnf(c_0_18,negated_conjecture,
    join(composition(X1,sk1),composition(X1,sk2)) = composition(X1,sk2),
    inference(spm,[status(thm)],[c_0_16,c_0_12]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : REL009-1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11  % 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.32  % Computer : n017.cluster.edu
% 0.14/0.32  % Model    : x86_64 x86_64
% 0.14/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32  % Memory   : 8042.1875MB
% 0.14/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32  % CPULimit   : 300
% 0.14/0.32  % WCLimit    : 300
% 0.14/0.32  % DateTime   : Tue May  5 01:38:57 EDT 2026
% 0.14/0.32  % CPUTime    : 
% 0.14/0.33  % start to proof: theBenchmark
% 3.71/3.19  % Version  : CSE_E---1.7
% 3.71/3.19  % Problem  : theBenchmark.p
% 3.71/3.19  % SZS status Unsatisfiable for theBenchmark.p
% 3.71/3.19  % SZS output start CNFRefutation
% See solution above
% 3.71/3.20  % Total time : 2.372s
%------------------------------------------------------------------------------