TSTP Solution File: LCL686+1.001 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL686+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n005.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:59:11 EDT 2023
% Result : Theorem 0.20s 0.61s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 29 ( 6 unt; 11 typ; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 27 ( 5 avg)
% Number of connectives : 158 ( 77 ~; 61 |; 20 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 7 >; 1 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 33 ( 0 sgn; 20 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
r1: ( $i * $i ) > $o ).
tff(decl_23,type,
p3: $i > $o ).
tff(decl_24,type,
p1: $i > $o ).
tff(decl_25,type,
p2: $i > $o ).
tff(decl_26,type,
esk1_0: $i ).
tff(decl_27,type,
esk2_0: $i ).
tff(decl_28,type,
esk3_0: $i ).
tff(decl_29,type,
esk4_0: $i ).
tff(decl_30,type,
esk5_1: $i > $i ).
tff(decl_31,type,
esk6_1: $i > $i ).
tff(decl_32,type,
esk7_1: $i > $i ).
fof(main,conjecture,
~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ p3(X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ $true )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ( p2(X2)
& ~ p1(X2) )
| ( ~ p2(X2)
& p1(X2) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ( ~ p1(X2)
& ~ p2(X2) )
| ( p2(X2)
& p1(X2) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).
fof(c_0_2,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ p3(X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ! [X2] : ~ r1(X1,X2)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ( p2(X2)
& ~ p1(X2) )
| ( ~ p2(X2)
& p1(X2) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ( ~ p1(X2)
& ~ p2(X2) )
| ( p2(X2)
& p1(X2) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]) ).
fof(c_0_3,negated_conjecture,
! [X12,X14] :
( r1(esk1_0,esk2_0)
& p3(esk2_0)
& r1(esk2_0,esk3_0)
& p1(esk3_0)
& r1(esk1_0,esk4_0)
& ( r1(X12,esk5_1(X12))
| ~ r1(esk4_0,X12) )
& ( ~ p2(X14)
| p1(X14)
| ~ r1(X12,X14)
| ~ r1(esk4_0,X12) )
& ( p2(X14)
| ~ p1(X14)
| ~ r1(X12,X14)
| ~ r1(esk4_0,X12) )
& ( r1(X12,esk6_1(X12))
| ~ r1(esk4_0,X12) )
& ( ~ p3(esk6_1(X12))
| ~ r1(esk4_0,X12) )
& ( r1(X12,esk7_1(X12))
| ~ r1(esk4_0,X12) )
& ( p1(esk7_1(X12))
| p2(esk7_1(X12))
| ~ r1(esk4_0,X12) )
& ( ~ p2(esk7_1(X12))
| ~ p1(esk7_1(X12))
| ~ r1(esk4_0,X12) ) ),
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_2])])])])]) ).
fof(c_0_4,plain,
! [X4] : r1(X4,X4),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_5,negated_conjecture,
( p1(X1)
| ~ p2(X1)
| ~ r1(X2,X1)
| ~ r1(esk4_0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( r1(X1,esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( p2(X1)
| ~ p1(X1)
| ~ r1(X2,X1)
| ~ r1(esk4_0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( p1(X1)
| ~ p2(X1)
| ~ r1(esk7_1(esk4_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
cnf(c_0_10,negated_conjecture,
( ~ p2(esk7_1(X1))
| ~ p1(esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
( p2(X1)
| ~ p1(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( p1(esk7_1(esk4_0))
| ~ p2(esk7_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( p1(esk7_1(X1))
| p2(esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
( ~ p1(esk7_1(X1))
| ~ r1(esk4_0,esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
p1(esk7_1(esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_7])]) ).
cnf(c_0_16,negated_conjecture,
~ r1(esk4_0,esk7_1(esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_7])]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : LCL686+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 25 07:20:38 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.59 start to proof: theBenchmark
% 0.20/0.61 % Version : CSE_E---1.5
% 0.20/0.61 % Problem : theBenchmark.p
% 0.20/0.61 % Proof found
% 0.20/0.61 % SZS status Theorem for theBenchmark.p
% 0.20/0.61 % SZS output start Proof
% See solution above
% 0.20/0.61 % Total time : 0.006000 s
% 0.20/0.61 % SZS output end Proof
% 0.20/0.61 % Total time : 0.009000 s
%------------------------------------------------------------------------------