TSTP Solution File: SYN078+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN078+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 : n025.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:59 EDT 2023
% Result : Theorem 0.15s 0.55s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 56 ( 9 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 60 ( 22 ~; 24 |; 8 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn; 7 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
big_p: $i > $o ).
tff(decl_23,type,
f: $i > $i ).
tff(decl_24,type,
esk1_0: $i ).
tff(decl_25,type,
esk2_0: $i ).
tff(decl_26,type,
esk3_0: $i ).
fof(pel56,conjecture,
( ! [X1] :
( ? [X2] :
( big_p(X2)
& X1 = f(X2) )
=> big_p(X1) )
<=> ! [X3] :
( big_p(X3)
=> big_p(f(X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel56) ).
fof(c_0_1,negated_conjecture,
~ ( ! [X1] :
( ? [X2] :
( big_p(X2)
& X1 = f(X2) )
=> big_p(X1) )
<=> ! [X3] :
( big_p(X3)
=> big_p(f(X3)) ) ),
inference(assume_negation,[status(cth)],[pel56]) ).
fof(c_0_2,negated_conjecture,
! [X7,X8,X9] :
( ( big_p(esk3_0)
| big_p(esk2_0) )
& ( ~ big_p(f(esk3_0))
| big_p(esk2_0) )
& ( big_p(esk3_0)
| esk1_0 = f(esk2_0) )
& ( ~ big_p(f(esk3_0))
| esk1_0 = f(esk2_0) )
& ( big_p(esk3_0)
| ~ big_p(esk1_0) )
& ( ~ big_p(f(esk3_0))
| ~ big_p(esk1_0) )
& ( ~ big_p(X8)
| X7 != f(X8)
| big_p(X7)
| ~ big_p(X9)
| big_p(f(X9)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
( big_p(X2)
| big_p(f(X3))
| ~ big_p(X1)
| X2 != f(X1)
| ~ big_p(X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_p(f(X1))
| big_p(f(X2))
| ~ big_p(X2)
| ~ big_p(X1) ),
inference(er,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
( esk1_0 = f(esk2_0)
| ~ big_p(f(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_p(f(X1))
| ~ big_p(X1) ),
inference(ef,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( big_p(esk3_0)
| esk1_0 = f(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( big_p(esk2_0)
| ~ big_p(f(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( big_p(esk3_0)
| big_p(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
f(esk2_0) = esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_11,negated_conjecture,
big_p(esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_6]),c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ big_p(f(esk3_0))
| ~ big_p(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
big_p(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_10]),c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
~ big_p(f(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_15,negated_conjecture,
( big_p(esk3_0)
| ~ big_p(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
~ big_p(esk3_0),
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_13])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN078+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.10 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.10/0.31 % Computer : n025.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sat Aug 26 17:10:38 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.53 start to proof: theBenchmark
% 0.15/0.55 % Version : CSE_E---1.5
% 0.15/0.55 % Problem : theBenchmark.p
% 0.15/0.55 % Proof found
% 0.15/0.55 % SZS status Theorem for theBenchmark.p
% 0.15/0.55 % SZS output start Proof
% See solution above
% 0.15/0.55 % Total time : 0.004000 s
% 0.15/0.55 % SZS output end Proof
% 0.15/0.55 % Total time : 0.006000 s
%------------------------------------------------------------------------------