TSTP Solution File: LCL636+1.001 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL636+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n002.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 : Thu Aug 31 06:54:49 EDT 2023
% Result : Theorem 0.22s 0.63s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 23 ( 6 unt; 11 typ; 0 def)
% Number of atoms : 266 ( 0 equ)
% Maximal formula atoms : 114 ( 22 avg)
% Number of connectives : 458 ( 204 ~; 170 |; 84 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 43 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 8 >; 1 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 41 ( 0 sgn; 38 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
r1: ( $i * $i ) > $o ).
tff(decl_23,type,
p2: $i > $o ).
tff(decl_24,type,
p102: $i > $o ).
tff(decl_25,type,
p101: $i > $o ).
tff(decl_26,type,
p100: $i > $o ).
tff(decl_27,type,
p1: $i > $o ).
tff(decl_28,type,
esk1_0: $i ).
tff(decl_29,type,
esk2_1: $i > $i ).
tff(decl_30,type,
esk3_1: $i > $i ).
tff(decl_31,type,
esk4_0: $i ).
tff(decl_32,type,
esk5_0: $i ).
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ( ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ( ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ p2(X2)
& ~ p102(X2)
& p101(X2) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ~ p102(X2)
& p101(X2) ) ) )
| ~ ( ~ p101(X1)
& p100(X1) ) )
& ( ( ( ! [X2] :
( ~ r1(X1,X2)
| ~ p2(X2)
| ~ p101(X2) )
| p2(X1) )
& ( ! [X2] :
( ~ r1(X1,X2)
| p2(X2)
| ~ p101(X2) )
| ~ p2(X1) ) )
| ~ p101(X1) )
& ( ( ( ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2)
| ~ p100(X2) )
| p1(X1) )
& ( ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ p100(X2) )
| ~ p1(X1) ) )
| ~ p100(X1) )
& ( p101(X1)
| ~ p102(X1) )
& ( p100(X1)
| ~ p101(X1) )
& ~ p101(X1)
& p100(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(c_0_1,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ( ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ( ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ p2(X2)
& ~ p102(X2)
& p101(X2) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( p2(X2)
& ~ p102(X2)
& p101(X2) ) ) )
| ~ ( ~ p101(X1)
& p100(X1) ) )
& ( ( ( ! [X2] :
( ~ r1(X1,X2)
| ~ p2(X2)
| ~ p101(X2) )
| p2(X1) )
& ( ! [X2] :
( ~ r1(X1,X2)
| p2(X2)
| ~ p101(X2) )
| ~ p2(X1) ) )
| ~ p101(X1) )
& ( ( ( ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2)
| ~ p100(X2) )
| p1(X1) )
& ( ! [X2] :
( ~ r1(X1,X2)
| p1(X2)
| ~ p100(X2) )
| ~ p1(X1) ) )
| ~ p100(X1) )
& ( p101(X1)
| ~ p102(X1) )
& ( p100(X1)
| ~ p101(X1) )
& ~ p101(X1)
& p100(X1) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]) ).
fof(c_0_2,negated_conjecture,
! [X4,X5,X8,X9,X10,X11,X14,X15,X16,X17] :
( ( ~ r1(esk1_0,X4)
| p2(X4) )
& ( r1(X5,esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ p2(esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ p102(esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p101(esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( r1(X5,esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p2(esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ p102(esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p101(esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ r1(X5,X8)
| ~ p2(X8)
| ~ p101(X8)
| p2(X5)
| ~ p101(X5)
| ~ r1(esk1_0,X5) )
& ( ~ r1(X5,X9)
| p2(X9)
| ~ p101(X9)
| ~ p2(X5)
| ~ p101(X5)
| ~ r1(esk1_0,X5) )
& ( ~ r1(X5,X10)
| ~ p1(X10)
| ~ p100(X10)
| p1(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ r1(X5,X11)
| p1(X11)
| ~ p100(X11)
| ~ p1(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p101(X5)
| ~ p102(X5)
| ~ r1(esk1_0,X5) )
& ( p100(X5)
| ~ p101(X5)
| ~ r1(esk1_0,X5) )
& ( r1(esk1_0,esk4_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( ~ p2(esk4_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( ~ p102(esk4_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( p101(esk4_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( r1(esk1_0,esk5_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( p2(esk5_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( ~ p102(esk5_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( p101(esk5_0)
| p101(esk1_0)
| ~ p100(esk1_0) )
& ( ~ r1(esk1_0,X14)
| ~ p2(X14)
| ~ p101(X14)
| p2(esk1_0)
| ~ p101(esk1_0) )
& ( ~ r1(esk1_0,X15)
| p2(X15)
| ~ p101(X15)
| ~ p2(esk1_0)
| ~ p101(esk1_0) )
& ( ~ r1(esk1_0,X16)
| ~ p1(X16)
| ~ p100(X16)
| p1(esk1_0)
| ~ p100(esk1_0) )
& ( ~ r1(esk1_0,X17)
| p1(X17)
| ~ p100(X17)
| ~ p1(esk1_0)
| ~ p100(esk1_0) )
& ( p101(esk1_0)
| ~ p102(esk1_0) )
& ( p100(esk1_0)
| ~ p101(esk1_0) )
& ~ p101(esk1_0)
& p100(esk1_0) ),
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,
( p101(esk1_0)
| ~ p2(esk4_0)
| ~ p100(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
p100(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
~ p101(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( r1(esk1_0,esk4_0)
| p101(esk1_0)
| ~ p100(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
~ p2(esk4_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]),c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( p2(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
r1(esk1_0,esk4_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_4])]),c_0_5]) ).
cnf(c_0_10,negated_conjecture,
~ r1(esk1_0,esk4_0),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL636+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.37 % Computer : n002.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8042.1875MB
% 0.13/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Fri Aug 25 07:36:47 EDT 2023
% 0.13/0.37 % CPUTime :
% 0.22/0.62 start to proof: theBenchmark
% 0.22/0.63 % Version : CSE_E---1.5
% 0.22/0.63 % Problem : theBenchmark.p
% 0.22/0.63 % Proof found
% 0.22/0.63 % SZS status Theorem for theBenchmark.p
% 0.22/0.63 % SZS output start Proof
% See solution above
% 0.22/0.64 % Total time : 0.006000 s
% 0.22/0.64 % SZS output end Proof
% 0.22/0.64 % Total time : 0.008000 s
%------------------------------------------------------------------------------