TSTP Solution File: SYN009-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN009-2 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n004.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:41 EDT 2023
% Result : Unsatisfiable 0.22s 0.65s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYN009-2 : TPTP v8.1.2. Released v2.5.0.
% 0.08/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.14/0.36 % Computer : n004.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat Aug 26 19:28:07 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.60 start to proof:theBenchmark
% 0.22/0.65 %-------------------------------------------
% 0.22/0.65 % File :CSE---1.6
% 0.22/0.65 % Problem :theBenchmark
% 0.22/0.65 % Transform :cnf
% 0.22/0.65 % Format :tptp:raw
% 0.22/0.65 % Command :java -jar mcs_scs.jar %d %s
% 0.22/0.65
% 0.22/0.65 % Result :Theorem 0.000000s
% 0.22/0.65 % Output :CNFRefutation 0.000000s
% 0.22/0.65 %-------------------------------------------
% 0.22/0.65 %--------------------------------------------------------------------------
% 0.22/0.65 % File : SYN009-2 : TPTP v8.1.2. Released v2.5.0.
% 0.22/0.65 % Domain : Syntactic
% 0.22/0.65 % Problem : A problem to demonstrate the usefulness of relevancy testing
% 0.22/0.65 % Version : Especial.
% 0.22/0.65 % English :
% 0.22/0.65
% 0.22/0.65 % Refs : [HC+98] A-SATCHMORE: SATCHMORE with Availability Checking
% 0.22/0.65 % Source : [HC+98]
% 0.22/0.65 % Names : Example 6.1 [HC+98]
% 0.22/0.65
% 0.22/0.65 % Status : Unsatisfiable
% 0.22/0.65 % Rating : 0.00 v2.5.0
% 0.22/0.65 % Syntax : Number of clauses : 8 ( 4 unt; 1 nHn; 8 RR)
% 0.22/0.65 % Number of literals : 16 ( 0 equ; 9 neg)
% 0.22/0.65 % Maximal clause size : 6 ( 2 avg)
% 0.22/0.65 % Maximal term depth : 1 ( 1 avg)
% 0.22/0.65 % Number of predicates : 5 ( 5 usr; 0 prp; 1-3 aty)
% 0.22/0.65 % Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% 0.22/0.65 % Number of variables : 12 ( 0 sgn)
% 0.22/0.65 % SPC : CNF_UNS_EPR_NEQ_NHN
% 0.22/0.65
% 0.22/0.65 % Comments :
% 0.22/0.65 %--------------------------------------------------------------------------
% 0.22/0.65 cnf(clause_1,negated_conjecture,
% 0.22/0.65 ( ~ p(X,Y,Z)
% 0.22/0.65 | ~ t(X,Y,Z) ) ).
% 0.22/0.65
% 0.22/0.65 cnf(clause_2,negated_conjecture,
% 0.22/0.65 ( ~ q(X,Y,Z)
% 0.22/0.65 | ~ t(Y,Z,X) ) ).
% 0.22/0.65
% 0.22/0.65 cnf(clause_3,negated_conjecture,
% 0.22/0.65 ( ~ r(X,Y,Z)
% 0.22/0.65 | ~ t(Z,X,Y) ) ).
% 0.22/0.65
% 0.22/0.65 cnf(clause_4,negated_conjecture,
% 0.22/0.65 s(a) ).
% 0.22/0.65
% 0.22/0.65 cnf(clause_5,negated_conjecture,
% 0.22/0.65 s(b) ).
% 0.22/0.65
% 0.22/0.65 cnf(clause_6,negated_conjecture,
% 0.22/0.65 s(c) ).
% 0.22/0.65
% 0.22/0.65 cnf(clause_7,negated_conjecture,
% 0.22/0.65 t(c,c,c) ).
% 0.22/0.65
% 0.22/0.65 cnf(clause_8,negated_conjecture,
% 0.22/0.65 ( ~ s(X)
% 0.22/0.65 | ~ s(Y)
% 0.22/0.65 | ~ s(Z)
% 0.22/0.65 | p(X,Y,Z)
% 0.22/0.65 | q(Y,Z,X)
% 0.22/0.65 | r(Z,X,Y) ) ).
% 0.22/0.65
% 0.22/0.65 %--------------------------------------------------------------------------
% 0.22/0.65 %-------------------------------------------
% 0.22/0.65 % Proof found
% 0.22/0.65 % SZS status Theorem for theBenchmark
% 0.22/0.65 % SZS output start Proof
% 0.22/0.65 %ClaNum:8(EqnAxiom:0)
% 0.22/0.65 %VarNum:30(SingletonVarNum:12)
% 0.22/0.65 %MaxLitNum:6
% 0.22/0.65 %MaxfuncDepth:0
% 0.22/0.65 %SharedTerms:7
% 0.22/0.65 %goalClause: 1 2 3 4 5 6 7 8
% 0.22/0.65 %singleGoalClaCount:4
% 0.22/0.65 [1]P1(a1)
% 0.22/0.65 [2]P1(a2)
% 0.22/0.65 [3]P1(a3)
% 0.22/0.65 [4]P5(a3,a3,a3)
% 0.22/0.65 [5]~P5(x51,x52,x53)+~P2(x51,x52,x53)
% 0.22/0.65 [6]~P3(x62,x63,x61)+~P5(x61,x62,x63)
% 0.22/0.65 [7]~P4(x73,x71,x72)+~P5(x71,x72,x73)
% 0.22/0.65 [8]P4(x82,x83,x81)+P3(x83,x81,x82)+~P1(x83)+~P1(x82)+~P1(x81)+P2(x81,x82,x83)
% 0.22/0.65 %EqnAxiom
% 0.22/0.65
% 0.22/0.65 %-------------------------------------------
% 0.22/0.66 cnf(12,plain,
% 0.22/0.66 ($false),
% 0.22/0.66 inference(scs_inference,[],[3,4,7,6,8,5]),
% 0.22/0.66 ['proof']).
% 0.22/0.66 % SZS output end Proof
% 0.22/0.66 % Total time :0.000000s
%------------------------------------------------------------------------------