TSTP Solution File: SYN003-1.006 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN003-1.006 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n017.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:43:39 EDT 2023
% Result : Unsatisfiable 0.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN003-1.006 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Aug 26 16:30:56 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.56 start to proof:theBenchmark
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % File :CSE---1.6
% 0.20/0.61 % Problem :theBenchmark
% 0.20/0.61 % Transform :cnf
% 0.20/0.61 % Format :tptp:raw
% 0.20/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.61
% 0.20/0.61 % Result :Theorem 0.000000s
% 0.20/0.61 % Output :CNFRefutation 0.000000s
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 %--------------------------------------------------------------------------
% 0.20/0.61 % File : SYN003-1.006 : TPTP v8.1.2. Released v1.0.0.
% 0.20/0.61 % Domain : Syntactic
% 0.20/0.61 % Problem : Implications that form a contradiction
% 0.20/0.61 % Version : Biased.
% 0.20/0.61 % English : P1 & Q1 -> P2 P1 & R1 -> P2 Q -> Q1 R -> R1 :
% 0.20/0.61 % P2 & Q2 -> P3 P2 & R2 -> P3 Q -> Q2 R -> R2 :
% 0.20/0.61 % ...... ...... .... .... :
% 0.20/0.61 % Pk-1 & Qk-1 ->Pk Pk-1 & Rk-1 -> Pk Q -> Qk-1 R -> Rk-1 :
% 0.20/0.61 % P1 ~Pk Q R :
% 0.20/0.61 % : The size is k, in the above.
% 0.20/0.61
% 0.20/0.61 % Refs : [Pla82] Plaisted (1982), A Simplified Problem Reduction Format
% 0.20/0.61 % Source : [Pla82]
% 0.20/0.61 % Names : Problem 5.2 [Pla82]
% 0.20/0.61
% 0.20/0.61 % Status : Unsatisfiable
% 0.20/0.61 % Rating : 0.00 v2.1.0
% 0.20/0.61 % Syntax : Number of clauses : 24 ( 4 unt; 0 nHn; 24 RR)
% 0.20/0.61 % Number of literals : 54 ( 0 equ; 31 neg)
% 0.20/0.61 % Maximal clause size : 3 ( 2 avg)
% 0.20/0.61 % Maximal term depth : 0 ( 0 avg)
% 0.20/0.61 % Number of predicates : 18 ( 18 usr; 18 prp; 0-0 aty)
% 0.20/0.61 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.20/0.61 % Number of variables : 0 ( 0 sgn)
% 0.20/0.61 % SPC : CNF_UNS_PRP
% 0.20/0.61
% 0.20/0.61 % Comments : "This set of clauses can cause the following strategies to
% 0.20/0.61 % generate a search space which is exponential in k: All-negative
% 0.20/0.61 % resolution, set-of-support with ~Pk as the support set, input
% 0.20/0.61 % resolution, SL-resolution, locking resolution with a bad choice
% 0.20/0.61 % of indices, and ancestor-filter form (linear resolution)."
% 0.20/0.61 % [Pla82] p.243.
% 0.20/0.61 % : tptp2X: -f tptp -s6 SYN003-1.g
% 0.20/0.62 %--------------------------------------------------------------------------
% 0.20/0.62 cnf(pqp_1,negated_conjecture,
% 0.20/0.62 ( ~ p_1
% 0.20/0.62 | ~ q_1
% 0.20/0.62 | p_2 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(pqp_2,negated_conjecture,
% 0.20/0.62 ( ~ p_2
% 0.20/0.62 | ~ q_2
% 0.20/0.62 | p_3 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(pqp_3,negated_conjecture,
% 0.20/0.62 ( ~ p_3
% 0.20/0.62 | ~ q_3
% 0.20/0.62 | p_4 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(pqp_4,negated_conjecture,
% 0.20/0.62 ( ~ p_4
% 0.20/0.62 | ~ q_4
% 0.20/0.62 | p_5 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(pqp_5,negated_conjecture,
% 0.20/0.62 ( ~ p_5
% 0.20/0.62 | ~ q_5
% 0.20/0.62 | p_6 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(prp_1,negated_conjecture,
% 0.20/0.62 ( ~ p_1
% 0.20/0.62 | ~ r_1
% 0.20/0.62 | p_2 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(prp_2,negated_conjecture,
% 0.20/0.62 ( ~ p_2
% 0.20/0.62 | ~ r_2
% 0.20/0.62 | p_3 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(prp_3,negated_conjecture,
% 0.20/0.62 ( ~ p_3
% 0.20/0.62 | ~ r_3
% 0.20/0.62 | p_4 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(prp_4,negated_conjecture,
% 0.20/0.62 ( ~ p_4
% 0.20/0.62 | ~ r_4
% 0.20/0.62 | p_5 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(prp_5,negated_conjecture,
% 0.20/0.62 ( ~ p_5
% 0.20/0.62 | ~ r_5
% 0.20/0.62 | p_6 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(qq_1,negated_conjecture,
% 0.20/0.62 ( ~ q
% 0.20/0.62 | q_1 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(qq_2,negated_conjecture,
% 0.20/0.62 ( ~ q
% 0.20/0.62 | q_2 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(qq_3,negated_conjecture,
% 0.20/0.62 ( ~ q
% 0.20/0.62 | q_3 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(qq_4,negated_conjecture,
% 0.20/0.62 ( ~ q
% 0.20/0.62 | q_4 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(qq_5,negated_conjecture,
% 0.20/0.62 ( ~ q
% 0.20/0.62 | q_5 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(rr_1,negated_conjecture,
% 0.20/0.62 ( ~ r
% 0.20/0.62 | r_1 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(rr_2,negated_conjecture,
% 0.20/0.62 ( ~ r
% 0.20/0.62 | r_2 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(rr_3,negated_conjecture,
% 0.20/0.62 ( ~ r
% 0.20/0.62 | r_3 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(rr_4,negated_conjecture,
% 0.20/0.62 ( ~ r
% 0.20/0.62 | r_4 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(rr_5,negated_conjecture,
% 0.20/0.62 ( ~ r
% 0.20/0.62 | r_5 ) ).
% 0.20/0.62
% 0.20/0.62 cnf(base_1,negated_conjecture,
% 0.20/0.62 p_1 ).
% 0.20/0.62
% 0.20/0.62 cnf(base_2,negated_conjecture,
% 0.20/0.62 ~ p_6 ).
% 0.20/0.62
% 0.20/0.62 cnf(base_3,negated_conjecture,
% 0.20/0.62 q ).
% 0.20/0.62
% 0.20/0.62 cnf(base_4,negated_conjecture,
% 0.20/0.62 r ).
% 0.20/0.62
% 0.20/0.62 %--------------------------------------------------------------------------
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % Proof found
% 0.20/0.62 % SZS status Theorem for theBenchmark
% 0.20/0.62 % SZS output start Proof
% 0.20/0.62 %ClaNum:24(EqnAxiom:0)
% 0.20/0.62 %VarNum:0(SingletonVarNum:0)
% 0.20/0.62 %MaxLitNum:3
% 0.20/0.62 %MaxfuncDepth:0
% 0.20/0.62 %SharedTerms:37
% 0.20/0.62 %goalClause: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
% 0.20/0.62 %singleGoalClaCount:4
% 0.20/0.62 [1]P1(a500)
% 0.20/0.62 [2]P2(a500)
% 0.20/0.62 [3]P8(a500)
% 0.20/0.62 [4]~P3(a500)
% 0.20/0.62 [5]P9(a500)+~P2(a500)
% 0.20/0.62 [6]P10(a500)+~P2(a500)
% 0.20/0.62 [7]P11(a500)+~P2(a500)
% 0.20/0.62 [8]P12(a500)+~P2(a500)
% 0.20/0.62 [9]P13(a500)+~P2(a500)
% 0.20/0.62 [10]P14(a500)+~P8(a500)
% 0.20/0.62 [11]P15(a500)+~P8(a500)
% 0.20/0.62 [12]P16(a500)+~P8(a500)
% 0.20/0.62 [13]P17(a500)+~P8(a500)
% 0.20/0.62 [14]P18(a500)+~P8(a500)
% 0.20/0.62 [15]P4(a500)+~P1(a500)+~P9(a500)
% 0.20/0.62 [16]P4(a500)+~P1(a500)+~P14(a500)
% 0.20/0.62 [17]P5(a500)+~P4(a500)+~P10(a500)
% 0.20/0.62 [18]P5(a500)+~P4(a500)+~P15(a500)
% 0.20/0.62 [19]P6(a500)+~P5(a500)+~P11(a500)
% 0.20/0.62 [20]P6(a500)+~P5(a500)+~P16(a500)
% 0.20/0.62 [21]P7(a500)+~P6(a500)+~P12(a500)
% 0.20/0.62 [22]P7(a500)+~P6(a500)+~P17(a500)
% 0.20/0.62 [23]P3(a500)+~P7(a500)+~P13(a500)
% 0.20/0.62 [24]P3(a500)+~P7(a500)+~P18(a500)
% 0.20/0.62 %EqnAxiom
% 0.20/0.62
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 cnf(39,plain,
% 0.20/0.62 ($false),
% 0.20/0.62 inference(scs_inference,[],[1,2,3,4,14,13,12,11,10,9,8,7,6,5,16,24,22,20,18]),
% 0.20/0.62 ['proof']).
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------