TSTP Solution File: SYN577-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN577-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n018.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:18 EDT 2023
% Result : Unsatisfiable 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 31
% Syntax : Number of formulae : 58 ( 23 unt; 21 typ; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 57 ( 31 ~; 24 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 7 >; 6 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 12 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn; 2 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
p2: ( $i * $i ) > $o ).
tff(decl_23,type,
c14: $i ).
tff(decl_24,type,
c13: $i ).
tff(decl_25,type,
p8: ( $i * $i ) > $o ).
tff(decl_26,type,
c11: $i ).
tff(decl_27,type,
c12: $i ).
tff(decl_28,type,
p7: ( $i * $i ) > $o ).
tff(decl_29,type,
c9: $i ).
tff(decl_30,type,
c10: $i ).
tff(decl_31,type,
f3: ( $i * $i ) > $i ).
tff(decl_32,type,
c15: $i ).
tff(decl_33,type,
c16: $i ).
tff(decl_34,type,
f4: ( $i * $i ) > $i ).
tff(decl_35,type,
c18: $i ).
tff(decl_36,type,
c17: $i ).
tff(decl_37,type,
f6: $i > $i ).
tff(decl_38,type,
c19: $i ).
tff(decl_39,type,
f5: ( $i * $i ) > $i ).
tff(decl_40,type,
c20: $i ).
tff(decl_41,type,
epred1_0: $o ).
tff(decl_42,type,
epred2_0: $o ).
cnf(p2_14,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_14) ).
cnf(p2_1,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_1) ).
cnf(p2_9,negated_conjecture,
p2(f4(c15,c14),c17),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_9) ).
cnf(p2_8,negated_conjecture,
p2(f4(c16,c14),c18),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_8) ).
cnf(p2_11,negated_conjecture,
p2(f5(f6(c9),c19),c17),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_11) ).
cnf(p2_12,negated_conjecture,
p2(f5(f6(c9),c20),c18),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_12) ).
cnf(not_p7_20,negated_conjecture,
( ~ p7(X1,c10)
| ~ p2(c15,X2)
| ~ p2(c16,X3)
| ~ p2(f4(X2,c14),f5(f6(X1),c19))
| ~ p2(f4(X3,c14),f5(f6(X1),c20)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p7_20) ).
cnf(p7_5,negated_conjecture,
p7(c9,c10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p7_5) ).
cnf(c_0_8,negated_conjecture,
( p2(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X3,X2) ),
p2_14 ).
cnf(c_0_9,negated_conjecture,
p2(X1,X1),
p2_1 ).
cnf(c_0_10,negated_conjecture,
( p2(X1,X2)
| ~ p2(X2,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
p2(f4(c15,c14),c17),
p2_9 ).
cnf(c_0_12,negated_conjecture,
p2(f4(c16,c14),c18),
p2_8 ).
cnf(c_0_13,negated_conjecture,
p2(c17,f4(c15,c14)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
p2(f5(f6(c9),c19),c17),
p2_11 ).
cnf(c_0_15,negated_conjecture,
p2(c18,f4(c16,c14)),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
p2(f5(f6(c9),c20),c18),
p2_12 ).
fof(c_0_17,plain,
( ~ epred2_0
<=> ! [X2] :
( ~ p2(c15,X2)
| ~ p2(f4(X2,c14),f5(f6(c9),c19)) ) ),
introduced(definition) ).
cnf(c_0_18,negated_conjecture,
( p2(X1,f4(c15,c14))
| ~ p2(c17,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
p2(c17,f5(f6(c9),c19)),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
fof(c_0_20,plain,
( ~ epred1_0
<=> ! [X1] :
( ~ p2(c16,X1)
| ~ p2(f4(X1,c14),f5(f6(c9),c20)) ) ),
introduced(definition) ).
cnf(c_0_21,negated_conjecture,
( p2(X1,f4(c16,c14))
| ~ p2(c18,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
p2(c18,f5(f6(c9),c20)),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( epred2_0
| ~ p2(f4(X1,c14),f5(f6(c9),c19))
| ~ p2(c15,X1) ),
inference(split_equiv,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
p2(f5(f6(c9),c19),f4(c15,c14)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( epred1_0
| ~ p2(f4(X1,c14),f5(f6(c9),c20))
| ~ p2(c16,X1) ),
inference(split_equiv,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
p2(f5(f6(c9),c20),f4(c16,c14)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( ~ p7(X1,c10)
| ~ p2(c15,X2)
| ~ p2(c16,X3)
| ~ p2(f4(X2,c14),f5(f6(X1),c19))
| ~ p2(f4(X3,c14),f5(f6(X1),c20)) ),
not_p7_20 ).
cnf(c_0_28,negated_conjecture,
p7(c9,c10),
p7_5 ).
cnf(c_0_29,negated_conjecture,
( epred2_0
| ~ p2(f4(c15,c14),f5(f6(c9),c19)) ),
inference(spm,[status(thm)],[c_0_23,c_0_9]) ).
cnf(c_0_30,negated_conjecture,
p2(f4(c15,c14),f5(f6(c9),c19)),
inference(spm,[status(thm)],[c_0_10,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( epred1_0
| ~ p2(f4(c16,c14),f5(f6(c9),c20)) ),
inference(spm,[status(thm)],[c_0_25,c_0_9]) ).
cnf(c_0_32,negated_conjecture,
p2(f4(c16,c14),f5(f6(c9),c20)),
inference(spm,[status(thm)],[c_0_10,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_20]),c_0_17]) ).
cnf(c_0_34,negated_conjecture,
epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_35,negated_conjecture,
epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN577-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 20:32:45 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.60 % Version : CSE_E---1.5
% 0.20/0.60 % Problem : theBenchmark.p
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark.p
% 0.20/0.60 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.010000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.013000 s
%------------------------------------------------------------------------------