TSTP Solution File: SYN920+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN920+1 : TPTP v8.1.2. Released v3.1.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 02:00:01 EDT 2023
% Result : Theorem 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 4 unt; 5 typ; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 93 ( 29 ~; 30 |; 20 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 21 ( 0 sgn; 12 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
f: $i > $o ).
tff(decl_23,type,
g: $i > $o ).
tff(decl_24,type,
h: $i > $o ).
tff(decl_25,type,
esk1_0: $i ).
tff(decl_26,type,
esk2_0: $i ).
fof(prove_this,conjecture,
( ( ( ! [X1] :
( ( f(X1)
& g(X1) )
=> h(X1) )
=> ? [X1] :
( f(X1)
& ~ g(X1) ) )
& ( ! [X2] :
( f(X2)
=> g(X2) )
| ! [X3] :
( f(X3)
=> h(X3) ) ) )
=> ( ! [X4] :
( ( f(X4)
& h(X4) )
=> g(X4) )
=> ? [X5] :
( f(X5)
& g(X5)
& ~ h(X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(c_0_1,negated_conjecture,
~ ( ( ( ! [X1] :
( ( f(X1)
& g(X1) )
=> h(X1) )
=> ? [X1] :
( f(X1)
& ~ g(X1) ) )
& ( ! [X2] :
( f(X2)
=> g(X2) )
| ! [X3] :
( f(X3)
=> h(X3) ) ) )
=> ( ! [X4] :
( ( f(X4)
& h(X4) )
=> g(X4) )
=> ? [X5] :
( f(X5)
& g(X5)
& ~ h(X5) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_this])]) ).
fof(c_0_2,negated_conjecture,
! [X8,X9,X10,X11] :
( ( f(esk2_0)
| f(esk1_0) )
& ( ~ g(esk2_0)
| f(esk1_0) )
& ( f(esk2_0)
| g(esk1_0) )
& ( ~ g(esk2_0)
| g(esk1_0) )
& ( f(esk2_0)
| ~ h(esk1_0) )
& ( ~ g(esk2_0)
| ~ h(esk1_0) )
& ( ~ f(X8)
| g(X8)
| ~ f(X9)
| h(X9) )
& ( ~ f(X10)
| ~ h(X10)
| g(X10) )
& ( ~ f(X11)
| ~ g(X11)
| h(X11) ) ),
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,
( f(esk2_0)
| ~ h(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( h(X1)
| ~ f(X1)
| ~ g(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( f(esk2_0)
| f(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( f(esk2_0)
| g(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( g(X1)
| h(X2)
| ~ f(X1)
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
f(esk2_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]),c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( ~ g(esk2_0)
| ~ h(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( f(esk1_0)
| ~ g(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( g(esk1_0)
| ~ g(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( h(esk2_0)
| g(X1)
| ~ f(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
~ g(esk2_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_4]),c_0_10]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( g(X1)
| ~ f(X1)
| ~ h(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
h(esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_8]),c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_8])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN920+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 19:07:32 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.57 % Version : CSE_E---1.5
% 0.19/0.57 % Problem : theBenchmark.p
% 0.19/0.57 % Proof found
% 0.19/0.57 % SZS status Theorem for theBenchmark.p
% 0.19/0.57 % SZS output start Proof
% See solution above
% 0.19/0.57 % Total time : 0.004000 s
% 0.19/0.57 % SZS output end Proof
% 0.19/0.57 % Total time : 0.007000 s
%------------------------------------------------------------------------------