TSTP Solution File: SYN590-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN590-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n012.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:53:21 EDT 2023
% Result : Unsatisfiable 0.19s 0.59s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 25
% Syntax : Number of formulae : 39 ( 6 unt; 17 typ; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 50 ( 27 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 11 >; 5 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-1 aty)
% Number of variables : 26 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
c14: $i ).
tff(decl_23,type,
p11: $i > $o ).
tff(decl_24,type,
c17: $i ).
tff(decl_25,type,
c16: $i ).
tff(decl_26,type,
p5: ( $i * $i ) > $o ).
tff(decl_27,type,
p2: ( $i * $i ) > $o ).
tff(decl_28,type,
p3: ( $i * $i ) > $o ).
tff(decl_29,type,
f4: $i > $i ).
tff(decl_30,type,
c18: $i ).
tff(decl_31,type,
f6: $i > $i ).
tff(decl_32,type,
c15: $i ).
tff(decl_33,type,
f9: $i > $i ).
tff(decl_34,type,
p12: ( $i * $i ) > $o ).
tff(decl_35,type,
p10: ( $i * $i ) > $o ).
tff(decl_36,type,
f8: $i > $i ).
tff(decl_37,type,
f7: $i > $i ).
tff(decl_38,type,
c13: $i ).
cnf(p10_26,negated_conjecture,
( p10(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X4,X2)
| ~ p10(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10_26) ).
cnf(p3_8,negated_conjecture,
p3(f4(c16),f6(c15)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_8) ).
cnf(p10_19,negated_conjecture,
( p10(f4(f9(X1)),f4(X1))
| ~ p11(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10_19) ).
cnf(c16_is_p11_3,negated_conjecture,
p11(c16),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c16_is_p11_3) ).
cnf(p3_18,negated_conjecture,
( p3(f4(X1),f6(f8(X1)))
| ~ p11(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_18) ).
cnf(not_p11_25,negated_conjecture,
( ~ p11(X1)
| ~ p12(X2,c15)
| ~ p3(f4(X1),f6(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p11_25) ).
cnf(p12_11,negated_conjecture,
( p12(X1,X2)
| ~ p10(f6(X1),f6(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12_11) ).
cnf(p11_9,negated_conjecture,
( p11(f9(X1))
| ~ p11(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p11_9) ).
cnf(c_0_8,negated_conjecture,
( p10(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X4,X2)
| ~ p10(X3,X4) ),
p10_26 ).
cnf(c_0_9,negated_conjecture,
p3(f4(c16),f6(c15)),
p3_8 ).
cnf(c_0_10,negated_conjecture,
( p10(X1,f6(c15))
| ~ p10(X2,f4(c16))
| ~ p3(X2,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
( p10(f4(f9(X1)),f4(X1))
| ~ p11(X1) ),
p10_19 ).
cnf(c_0_12,negated_conjecture,
p11(c16),
c16_is_p11_3 ).
cnf(c_0_13,negated_conjecture,
( p10(X1,f6(c15))
| ~ p3(f4(f9(c16)),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_14,negated_conjecture,
( p3(f4(X1),f6(f8(X1)))
| ~ p11(X1) ),
p3_18 ).
cnf(c_0_15,negated_conjecture,
( ~ p11(X1)
| ~ p12(X2,c15)
| ~ p3(f4(X1),f6(X2)) ),
not_p11_25 ).
cnf(c_0_16,negated_conjecture,
( p12(X1,X2)
| ~ p10(f6(X1),f6(X2)) ),
p12_11 ).
cnf(c_0_17,negated_conjecture,
( p10(f6(f8(f9(c16))),f6(c15))
| ~ p11(f9(c16)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( ~ p12(f8(X1),c15)
| ~ p11(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ p11(f9(c16)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( p11(f9(X1))
| ~ p11(X1) ),
p11_9 ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN590-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n012.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 18:09:25 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.59 % Version : CSE_E---1.5
% 0.19/0.59 % Problem : theBenchmark.p
% 0.19/0.59 % Proof found
% 0.19/0.59 % SZS status Theorem for theBenchmark.p
% 0.19/0.59 % SZS output start Proof
% See solution above
% 0.19/0.59 % Total time : 0.020000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.023000 s
%------------------------------------------------------------------------------