↑ Up

CSE_E---1.7.SAT-Sat.s

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

% Computer : n022.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:40:17 PM UTC 2026

% Result   : Satisfiable 1.18s 1.88s
% Output   : Saturation 1.18s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(candidate,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,implies(implies(X3,X1),X4)),implies(X1,X4)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',candidate) ).

cnf(prove_required_property,negated_conjecture,
    ~ is_a_theorem(implies(a,implies(b,a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_required_property) ).

cnf(c_0_3,axiom,
    ( is_a_theorem(X2)
    | ~ is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(X1) ),
    condensed_detachment,
    [final] ).

cnf(c_0_4,axiom,
    is_a_theorem(implies(implies(X1,X2),implies(implies(X2,implies(implies(X3,X1),X4)),implies(X1,X4)))),
    candidate,
    [final] ).

cnf(c_0_5,plain,
    ( is_a_theorem(implies(implies(X1,implies(implies(X2,X3),X4)),implies(X3,X4)))
    | ~ is_a_theorem(implies(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]),
    [final] ).

cnf(c_0_6,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X3,implies(implies(X4,X1),X2)))
    | ~ is_a_theorem(implies(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_3,c_0_5]),
    [final] ).

cnf(c_0_7,plain,
    ( is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3)))
    | ~ is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X4))) ),
    inference(spm,[status(thm)],[c_0_6,c_0_4]),
    [final] ).

cnf(c_0_8,plain,
    ( is_a_theorem(implies(implies(implies(X1,X2),implies(implies(X3,X2),X4)),implies(X2,implies(implies(X3,X2),X4))))
    | ~ is_a_theorem(implies(X2,implies(X1,X2))) ),
    inference(spm,[status(thm)],[c_0_7,c_0_5]),
    [final] ).

cnf(c_0_9,plain,
    ( is_a_theorem(implies(X1,implies(implies(X2,X1),X3)))
    | ~ is_a_theorem(implies(implies(X4,X1),implies(implies(X2,X1),X3)))
    | ~ is_a_theorem(implies(X1,implies(X4,X1))) ),
    inference(spm,[status(thm)],[c_0_3,c_0_8]),
    [final] ).

cnf(c_0_10,plain,
    ( is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(implies(implies(X1,X2),X3),implies(implies(X1,X2),X3)),implies(X2,X3))))
    | ~ is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,implies(implies(X1,X2),X3)))) ),
    inference(spm,[status(thm)],[c_0_9,c_0_4]),
    [final] ).

cnf(c_0_11,plain,
    ( is_a_theorem(implies(implies(implies(implies(X1,X2),X3),implies(implies(X1,X2),X3)),implies(X2,X3)))
    | ~ is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,implies(implies(X1,X2),X3))))
    | ~ is_a_theorem(implies(implies(X1,X2),X3)) ),
    inference(spm,[status(thm)],[c_0_3,c_0_10]),
    [final] ).

cnf(c_0_12,plain,
    ( is_a_theorem(implies(implies(implies(implies(X1,X2),X2),implies(implies(X1,X2),X2)),implies(X2,implies(implies(X1,X2),X2))))
    | ~ is_a_theorem(implies(implies(implies(X1,X2),X2),implies(X2,implies(implies(X1,X2),X2))))
    | ~ is_a_theorem(implies(implies(X1,X2),X2)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_11]),
    [final] ).

cnf(c_0_13,plain,
    ( is_a_theorem(implies(X1,implies(implies(X2,implies(X3,X1)),implies(X3,X1))))
    | ~ is_a_theorem(implies(implies(implies(X2,implies(X3,X1)),implies(X3,X1)),implies(implies(X3,X1),implies(implies(X2,implies(X3,X1)),implies(X3,X1)))))
    | ~ is_a_theorem(implies(X1,implies(implies(implies(X2,implies(X3,X1)),implies(X3,X1)),implies(implies(X2,implies(X3,X1)),implies(X3,X1)))))
    | ~ is_a_theorem(implies(implies(X2,implies(X3,X1)),implies(X3,X1))) ),
    inference(spm,[status(thm)],[c_0_6,c_0_12]),
    [final] ).

cnf(c_0_14,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(implies(implies(X3,implies(X4,X1)),X2),implies(implies(X4,X1),implies(implies(X3,implies(X4,X1)),X2))))
    | ~ is_a_theorem(implies(X1,implies(implies(implies(X3,implies(X4,X1)),X2),implies(implies(X3,implies(X4,X1)),X2))))
    | ~ is_a_theorem(implies(implies(X3,implies(X4,X1)),X2)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_11]),
    [final] ).

cnf(c_0_15,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(implies(implies(X3,X1),X2),implies(X1,implies(implies(X3,X1),X2))))
    | ~ is_a_theorem(implies(implies(implies(X3,X1),X2),implies(implies(X3,X1),X2)))
    | ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
    inference(spm,[status(thm)],[c_0_3,c_0_11]),
    [final] ).

cnf(c_0_16,plain,
    ( is_a_theorem(implies(X1,implies(implies(X2,implies(X3,X1)),X4)))
    | ~ is_a_theorem(implies(X1,implies(implies(X5,implies(X3,X1)),implies(implies(X2,implies(X3,X1)),X4))))
    | ~ is_a_theorem(implies(implies(X3,X1),implies(X5,implies(X3,X1)))) ),
    inference(spm,[status(thm)],[c_0_6,c_0_8]),
    [final] ).

cnf(c_0_17,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(X3,implies(implies(X4,implies(X5,X1)),X2))))
    | ~ is_a_theorem(implies(implies(X5,X1),X3)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_5]),
    [final] ).

cnf(c_0_18,negated_conjecture,
    ~ is_a_theorem(implies(a,implies(b,a))),
    prove_required_property,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.21  % Problem    : LCL415-1 : TPTP v9.2.1. Released v2.5.0.
% 0.03/0.21  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.13/0.46  % Computer : n022.cluster.edu
% 0.13/0.46  % Model    : x86_64 x86_64
% 0.13/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.46  % Memory   : 8042.1875MB
% 0.13/0.46  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.46  % CPULimit   : 300
% 0.13/0.46  % WCLimit    : 300
% 0.13/0.46  % DateTime   : Mon May  4 22:34:06 EDT 2026
% 0.13/0.47  % CPUTime    : 
% 0.13/0.47  % start to proof: theBenchmark
% 1.18/1.88  % Version  : CSE_E---1.7
% 1.18/1.88  % Problem  : theBenchmark.p
% 1.18/1.88  % SZS status Satisfiable for theBenchmark.p
% 1.18/1.88  % SZS output start Saturation
% See solution above
% 1.18/1.88  % Total time : 1.403s
%------------------------------------------------------------------------------