TSTP Solution File: SYN364+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN364+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n010.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:51:25 EDT 2023
% Result : Theorem 0.18s 0.58s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 23 ( 6 unt; 8 typ; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 46 ( 15 ~; 13 |; 12 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 7 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 35 ( 6 sgn; 16 !; 6 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
big_p: ( $i * $i ) > $o ).
tff(decl_23,type,
big_m: $i > $o ).
tff(decl_24,type,
f: ( $i * $i ) > $i ).
tff(decl_25,type,
big_q: $i > $o ).
tff(decl_26,type,
g: $i > $i ).
tff(decl_27,type,
esk1_1: $i > $i ).
tff(decl_28,type,
esk2_1: $i > $i ).
tff(decl_29,type,
esk3_0: $i ).
fof(x2115,conjecture,
( ( ! [X1] :
( ? [X2] : big_p(X1,X2)
=> ! [X3] : big_p(X3,X3) )
& ! [X4] :
? [X5] :
( big_p(X4,X5)
| ( big_m(X4)
& big_q(f(X4,X5)) ) )
& ! [X6] :
( big_q(X6)
=> ~ big_m(g(X6)) ) )
=> ! [X4] :
? [X5] :
( big_p(g(X4),X5)
& big_p(X4,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2115) ).
fof(c_0_1,negated_conjecture,
~ ( ( ! [X1] :
( ? [X2] : big_p(X1,X2)
=> ! [X3] : big_p(X3,X3) )
& ! [X4] :
? [X5] :
( big_p(X4,X5)
| ( big_m(X4)
& big_q(f(X4,X5)) ) )
& ! [X6] :
( big_q(X6)
=> ~ big_m(g(X6)) ) )
=> ! [X4] :
? [X5] :
( big_p(g(X4),X5)
& big_p(X4,X4) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[x2115])]) ).
fof(c_0_2,negated_conjecture,
! [X7,X8,X9,X10,X13,X15] :
( ( ~ big_p(X7,X8)
| big_p(X9,X9) )
& ( big_m(X10)
| big_p(X10,esk1_1(X10)) )
& ( big_q(f(X10,esk2_1(X10)))
| big_p(X10,esk1_1(X10)) )
& ( ~ big_q(X13)
| ~ big_m(g(X13)) )
& ( ~ big_p(g(esk3_0),X15)
| ~ big_p(esk3_0,esk3_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( big_p(X3,X3)
| ~ big_p(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_m(X1)
| big_p(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( ~ big_p(g(esk3_0),X1)
| ~ big_p(esk3_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_m(X1)
| big_p(X2,X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ~ big_q(X1)
| ~ big_m(g(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
big_m(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( big_q(f(X1,esk2_1(X1)))
| big_p(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
~ big_q(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_11,negated_conjecture,
big_p(X1,esk1_1(X1)),
inference(sr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
~ big_p(esk3_0,esk3_0),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
big_p(X1,X1),
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN364+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Aug 26 21:13:04 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.56 start to proof: theBenchmark
% 0.18/0.58 % Version : CSE_E---1.5
% 0.18/0.58 % Problem : theBenchmark.p
% 0.18/0.58 % Proof found
% 0.18/0.58 % SZS status Theorem for theBenchmark.p
% 0.18/0.58 % SZS output start Proof
% See solution above
% 0.18/0.58 % Total time : 0.004000 s
% 0.18/0.58 % SZS output end Proof
% 0.18/0.58 % Total time : 0.007000 s
%------------------------------------------------------------------------------