%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : KRS017-1 : TPTP v8.2.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n026.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 10:08:15 EDT 2024 % Result : Unsatisfiable 0.57s 0.62s % Output : CNFRefutation 0.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : KRS017-1 : TPTP v8.2.0. Released v2.0.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.13/0.34 % Computer : n026.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 : Wed Jun 19 13:45:39 EDT 2024 % 0.13/0.34 % CPUTime : % 0.21/0.58 start to proof:theBenchmark % 0.57/0.61 %------------------------------------------- % 0.57/0.61 % File :CSE---1.7 % 0.57/0.61 % Problem :theBenchmark % 0.57/0.61 % Transform :cnf % 0.57/0.61 % Format :tptp:raw % 0.57/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.57/0.61 % 0.57/0.61 % Result :Theorem 0.000000s % 0.57/0.61 % Output :CNFRefutation 0.000000s % 0.57/0.61 %------------------------------------------- % 0.57/0.62 %-------------------------------------------------------------------------- % 0.57/0.62 % File : KRS017-1 : TPTP v8.2.0. Released v2.0.0. % 0.57/0.62 % Domain : Knowledge Representation % 0.57/0.62 % Problem : Paramasivam problem T-Box 7a % 0.57/0.62 % Version : Especial. % 0.57/0.62 % English : a subsumes e. % 0.57/0.62 % 0.57/0.62 % Refs : [PP95] Paramasivam & Plaisted (1995), Automated Deduction Tec % 0.57/0.62 % Source : [PP95] % 0.57/0.62 % Names : Problem 7(a) [PP95] % 0.57/0.62 % 0.57/0.62 % Status : Unsatisfiable % 0.57/0.62 % Rating : 0.00 v6.3.0, 0.14 v6.2.0, 0.00 v2.1.0 % 0.57/0.62 % Syntax : Number of clauses : 7 ( 2 unt; 2 nHn; 7 RR) % 0.57/0.62 % Number of literals : 17 ( 0 equ; 9 neg) % 0.57/0.62 % Maximal clause size : 4 ( 2 avg) % 0.57/0.62 % Maximal term depth : 2 ( 1 avg) % 0.57/0.62 % Number of predicates : 3 ( 3 usr; 0 prp; 1-2 aty) % 0.57/0.62 % Number of functors : 4 ( 4 usr; 1 con; 0-1 aty) % 0.57/0.62 % Number of variables : 10 ( 3 sgn) % 0.57/0.62 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.57/0.62 % 0.57/0.62 % Comments : % 0.57/0.62 %-------------------------------------------------------------------------- % 0.57/0.62 cnf(clause_1,negated_conjecture, % 0.57/0.62 e(exists) ). % 0.57/0.62 % 0.57/0.62 cnf(clause_2,negated_conjecture, % 0.57/0.62 ~ a(exists) ). % 0.57/0.62 % 0.57/0.62 cnf(clause_3,axiom, % 0.57/0.62 ( r(X1,u0r3(X1)) % 0.57/0.62 | ~ e(X1) ) ). % 0.57/0.62 % 0.57/0.62 cnf(clause_4,axiom, % 0.57/0.62 ( a(X3) % 0.57/0.62 | ~ e(X1) % 0.57/0.62 | ~ r(X1,X2) % 0.57/0.62 | ~ r(X3,X2) ) ). % 0.57/0.62 % 0.57/0.62 cnf(clause_5,axiom, % 0.57/0.62 ( e(X1) % 0.57/0.62 | ~ a(u0r2(X1)) % 0.57/0.62 | ~ r(X1,X4) ) ). % 0.57/0.62 % 0.57/0.62 cnf(clause_6,axiom, % 0.57/0.62 ( e(X1) % 0.57/0.62 | r(u0r2(X1),u0r1(X1)) % 0.57/0.62 | ~ r(X1,X4) ) ). % 0.57/0.62 % 0.57/0.62 cnf(clause_7,axiom, % 0.57/0.62 ( e(X1) % 0.57/0.62 | r(X1,u0r1(X1)) % 0.57/0.62 | ~ r(X1,X4) ) ). % 0.57/0.62 % 0.57/0.62 %-------------------------------------------------------------------------- % 0.57/0.62 %------------------------------------------- % 0.57/0.62 % Proof found % 0.57/0.62 % SZS status Theorem for theBenchmark % 0.57/0.62 % SZS output start Proof % 0.57/0.62 %ClaNum:7(EqnAxiom:0) % 0.57/0.62 %VarNum:23(SingletonVarNum:10) % 0.57/0.62 %MaxLitNum:4 % 0.57/0.62 %MaxfuncDepth:1 % 0.57/0.62 %SharedTerms:3 % 0.57/0.62 %goalClause: 1 2 % 0.57/0.62 %singleGoalClaCount:2 % 0.57/0.62 [1]P1(a1) % 0.57/0.62 [2]~P2(a1) % 0.57/0.62 [3]~P1(x31)+P3(x31,f2(x31)) % 0.57/0.62 [4]P1(x41)+~P3(x41,x42)+~P2(f3(x41)) % 0.57/0.62 [5]P1(x51)+~P3(x51,x52)+P3(x51,f4(x51)) % 0.57/0.62 [6]P1(x61)+~P3(x61,x62)+P3(f3(x61),f4(x61)) % 0.57/0.62 [7]~P3(x71,x73)+P2(x71)+~P3(x72,x73)+~P1(x72) % 0.57/0.62 %EqnAxiom % 0.57/0.62 % 0.57/0.62 %------------------------------------------- % 0.57/0.62 cnf(10,plain, % 0.57/0.62 ($false), % 0.57/0.62 inference(scs_inference,[],[1,2,7,3]), % 0.57/0.62 ['proof']). % 0.57/0.62 % SZS output end Proof % 0.57/0.62 % Total time :0.000000s %------------------------------------------------------------------------------