%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN009-4 : TPTP v8.2.0. Released v2.5.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 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 : Mon Jun 24 19:04:14 EDT 2024 % Result : Unsatisfiable 0.53s 0.60s % Output : CNFRefutation 0.53s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN009-4 : TPTP v8.2.0. Released v2.5.0. % 0.03/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 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 : Mon Jun 24 00:10:08 EDT 2024 % 0.12/0.33 % CPUTime : % 0.52/0.56 start to proof:theBenchmark % 0.53/0.59 %------------------------------------------- % 0.53/0.59 % File :CSE---1.7 % 0.53/0.59 % Problem :theBenchmark % 0.53/0.59 % Transform :cnf % 0.53/0.59 % Format :tptp:raw % 0.53/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.53/0.59 % 0.53/0.59 % Result :Theorem 0.000000s % 0.53/0.59 % Output :CNFRefutation 0.000000s % 0.53/0.59 %------------------------------------------- % 0.53/0.59 %-------------------------------------------------------------------------- % 0.53/0.59 % File : SYN009-4 : TPTP v8.2.0. Released v2.5.0. % 0.53/0.59 % Domain : Syntactic % 0.53/0.59 % Problem : A problem to demonstrate the usefulness of relevancy testing % 0.53/0.59 % Version : Especial. % 0.53/0.59 % English : % 0.53/0.59 % 0.53/0.59 % Refs : [He01] UNSEARCHMO: Eliminating Redundant Search Space on Back % 0.53/0.59 % Source : [He01] % 0.53/0.59 % Names : Example 5.3 [He01] % 0.53/0.59 % 0.53/0.59 % Status : Unsatisfiable % 0.53/0.59 % Rating : 0.00 v2.5.0 % 0.53/0.59 % Syntax : Number of clauses : 9 ( 4 unt; 2 nHn; 9 RR) % 0.53/0.59 % Number of literals : 21 ( 0 equ; 13 neg) % 0.53/0.59 % Maximal clause size : 6 ( 2 avg) % 0.53/0.59 % Maximal term depth : 1 ( 1 avg) % 0.53/0.59 % Number of predicates : 6 ( 6 usr; 0 prp; 1-3 aty) % 0.53/0.59 % Number of functors : 3 ( 3 usr; 3 con; 0-0 aty) % 0.53/0.59 % Number of variables : 15 ( 0 sgn) % 0.53/0.59 % SPC : CNF_UNS_EPR_NEQ_NHN % 0.53/0.59 % 0.53/0.59 % Comments : % 0.53/0.59 %-------------------------------------------------------------------------- % 0.53/0.59 cnf(clause_1,negated_conjecture, % 0.53/0.59 ( ~ p(X,Y,Z) % 0.53/0.59 | ~ m(X,Y,Z) ) ). % 0.53/0.60 % 0.53/0.60 cnf(clause_2,negated_conjecture, % 0.53/0.60 ( ~ q(X,Y,Z) % 0.53/0.60 | ~ m(X,Y,Z) ) ). % 0.53/0.60 % 0.53/0.60 cnf(clause_3,negated_conjecture, % 0.53/0.60 ( ~ r(X,Y,Z) % 0.53/0.60 | ~ m(X,Y,Z) ) ). % 0.53/0.60 % 0.53/0.60 cnf(clause_4,negated_conjecture, % 0.53/0.60 s(a) ). % 0.53/0.60 % 0.53/0.60 cnf(clause_5,negated_conjecture, % 0.53/0.60 s(b) ). % 0.53/0.60 % 0.53/0.60 cnf(clause_6,negated_conjecture, % 0.53/0.60 s(c) ). % 0.53/0.60 % 0.53/0.60 cnf(clause_7,negated_conjecture, % 0.53/0.60 ~ n(c,c,c) ). % 0.53/0.60 % 0.53/0.60 cnf(clause_8,negated_conjecture, % 0.53/0.60 ( ~ s(X) % 0.53/0.60 | ~ s(Y) % 0.53/0.60 | ~ s(Z) % 0.53/0.60 | p(X,Y,Z) % 0.53/0.60 | q(X,Y,Z) % 0.53/0.60 | r(X,Y,Z) ) ). % 0.53/0.60 % 0.53/0.60 cnf(clause_9,negated_conjecture, % 0.53/0.60 ( ~ s(X) % 0.53/0.60 | ~ s(Y) % 0.53/0.60 | ~ s(Z) % 0.53/0.60 | m(X,Y,Z) % 0.53/0.60 | n(X,Y,Z) ) ). % 0.53/0.60 % 0.53/0.60 %-------------------------------------------------------------------------- % 0.53/0.60 %------------------------------------------- % 0.53/0.60 % Proof found % 0.53/0.60 % SZS status Theorem for theBenchmark % 0.53/0.60 % SZS output start Proof % 0.53/0.60 %ClaNum:9(EqnAxiom:0) % 0.53/0.60 %VarNum:39(SingletonVarNum:15) % 0.53/0.60 %MaxLitNum:6 % 0.53/0.60 %MaxfuncDepth:0 % 0.53/0.60 %SharedTerms:7 % 0.53/0.60 %goalClause: 1 2 3 4 5 6 7 8 9 % 0.53/0.60 %singleGoalClaCount:4 % 0.53/0.60 [1]P1(a1) % 0.53/0.60 [2]P1(a2) % 0.53/0.60 [3]P1(a3) % 0.53/0.60 [4]~P2(a3,a3,a3) % 0.53/0.60 [6]~P3(x61,x62,x63)+~P4(x61,x62,x63) % 0.53/0.60 [7]~P5(x71,x72,x73)+~P3(x71,x72,x73) % 0.53/0.60 [8]~P6(x81,x82,x83)+~P3(x81,x82,x83) % 0.53/0.60 [5]P2(x51,x52,x53)+~P1(x53)+~P1(x52)+~P1(x51)+P3(x51,x52,x53) % 0.53/0.60 [9]P5(x91,x92,x93)+P6(x91,x92,x93)+~P1(x93)+~P1(x92)+~P1(x91)+P4(x91,x92,x93) % 0.53/0.60 %EqnAxiom % 0.53/0.60 % 0.53/0.60 %------------------------------------------- % 0.53/0.60 cnf(18,plain, % 0.53/0.60 ($false), % 0.53/0.60 inference(scs_inference,[],[3,4,5,7,8,9,6]), % 0.53/0.60 ['proof']). % 0.53/0.60 % SZS output end Proof % 0.53/0.60 % Total time :0.000000s %------------------------------------------------------------------------------