TSTP Solution File: SYN049-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN049-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 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 : Fri Sep 1 01:49:18 EDT 2023
% Result : Unsatisfiable 0.21s 0.59s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of formulae : 12 ( 6 unt; 4 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 7 ( 5 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
f: $i > $i ).
tff(decl_23,type,
big_p: $i > $o ).
tff(decl_24,type,
g: $i > $i ).
tff(decl_25,type,
big_q: $i > $o ).
cnf(clause_1,negated_conjecture,
( big_q(g(X1))
| ~ big_p(f(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_2,negated_conjecture,
big_p(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_3,negated_conjecture,
~ big_q(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(c_0_3,negated_conjecture,
( big_q(g(X1))
| ~ big_p(f(X1)) ),
clause_1 ).
cnf(c_0_4,negated_conjecture,
big_p(X1),
clause_2 ).
cnf(c_0_5,negated_conjecture,
big_q(g(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]) ).
cnf(c_0_6,negated_conjecture,
~ big_q(X1),
clause_3 ).
cnf(c_0_7,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN049-1 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat Aug 26 19:39:02 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.57 start to proof: theBenchmark
% 0.21/0.59 % Version : CSE_E---1.5
% 0.21/0.59 % Problem : theBenchmark.p
% 0.21/0.59 % Proof found
% 0.21/0.59 % SZS status Theorem for theBenchmark.p
% 0.21/0.59 % SZS output start Proof
% See solution above
% 0.21/0.59 % Total time : 0.003000 s
% 0.21/0.59 % SZS output end Proof
% 0.21/0.59 % Total time : 0.005000 s
%------------------------------------------------------------------------------