%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : KRS001-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 : n008.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:12 EDT 2024 % Result : Unsatisfiable 0.54s 0.65s % Output : CNFRefutation 0.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS001-1 : TPTP v8.2.0. Released v2.0.0. % 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n008.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 : Wed Jun 19 14:00:53 EDT 2024 % 0.12/0.33 % CPUTime : % 0.53/0.57 start to proof:theBenchmark % 0.54/0.65 %------------------------------------------- % 0.54/0.65 % File :CSE---1.7 % 0.54/0.65 % Problem :theBenchmark % 0.54/0.65 % Transform :cnf % 0.54/0.65 % Format :tptp:raw % 0.54/0.65 % Command :java -jar mcs_scs.jar %d %s % 0.54/0.65 % 0.54/0.65 % Result :Theorem 0.040000s % 0.54/0.65 % Output :CNFRefutation 0.040000s % 0.54/0.65 %------------------------------------------- % 0.54/0.65 %-------------------------------------------------------------------------- % 0.54/0.65 % File : KRS001-1 : TPTP v8.2.0. Released v2.0.0. % 0.54/0.65 % Domain : Knowledge Representation % 0.54/0.65 % Problem : Paramasivam problem T-Box 1a % 0.54/0.65 % Version : Especial. % 0.54/0.65 % English : e exists. % 0.54/0.65 % 0.54/0.65 % Refs : [PP95] Paramasivam & Plaisted (1995), Automated Deduction Tec % 0.54/0.65 % Source : [PP95] % 0.54/0.65 % Names : Problem 1(a) [PP95] % 0.54/0.65 % 0.54/0.65 % Status : Unsatisfiable % 0.54/0.65 % Rating : 0.08 v8.2.0, 0.14 v8.1.0, 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.14 v6.2.0, 0.00 v2.1.0 % 0.54/0.65 % Syntax : Number of clauses : 16 ( 1 unt; 3 nHn; 14 RR) % 0.54/0.65 % Number of literals : 36 ( 0 equ; 18 neg) % 0.54/0.65 % Maximal clause size : 4 ( 2 avg) % 0.54/0.65 % Maximal term depth : 2 ( 1 avg) % 0.54/0.65 % Number of predicates : 7 ( 7 usr; 0 prp; 1-2 aty) % 0.54/0.65 % Number of functors : 5 ( 5 usr; 1 con; 0-1 aty) % 0.54/0.65 % Number of variables : 19 ( 0 sgn) % 0.54/0.65 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.54/0.65 % 0.54/0.65 % Comments : % 0.54/0.65 %-------------------------------------------------------------------------- % 0.54/0.65 cnf(clause_1,negated_conjecture, % 0.54/0.65 e(exist) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_2,axiom, % 0.54/0.65 ( r2least(X1) % 0.54/0.65 | ~ c(X1) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_3,axiom, % 0.54/0.65 ( c(X1) % 0.54/0.65 | ~ r2least(X1) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_4,axiom, % 0.54/0.65 ( ~ r2least(X1) % 0.54/0.65 | ~ equalish(u1r2(X1),u1r1(X1)) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_5,axiom, % 0.54/0.65 ( r(X1,u1r1(X1)) % 0.54/0.65 | ~ r2least(X1) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_6,axiom, % 0.54/0.65 ( r(X1,u1r2(X1)) % 0.54/0.65 | ~ r2least(X1) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_7,axiom, % 0.54/0.65 ( r2least(X1) % 0.54/0.65 | equalish(X3,X2) % 0.54/0.65 | ~ r(X1,X3) % 0.54/0.65 | ~ r(X1,X2) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_8,axiom, % 0.54/0.65 ( r1most(X1) % 0.54/0.65 | ~ d(X1) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_9,axiom, % 0.54/0.65 ( d(X1) % 0.54/0.65 | ~ r1most(X1) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_10,axiom, % 0.54/0.65 ( equalish(X3,X2) % 0.54/0.65 | ~ r1most(X1) % 0.54/0.65 | ~ r(X1,X3) % 0.54/0.65 | ~ r(X1,X2) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_11,axiom, % 0.54/0.65 ( r1most(X1) % 0.54/0.65 | ~ equalish(u3r2(X1),u3r1(X1)) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_12,axiom, % 0.54/0.65 ( r1most(X1) % 0.54/0.65 | r(X1,u3r1(X1)) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_13,axiom, % 0.54/0.65 ( r1most(X1) % 0.54/0.65 | r(X1,u3r2(X1)) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_14,axiom, % 0.54/0.65 ( d(X1) % 0.54/0.65 | ~ e(X1) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_15,axiom, % 0.54/0.65 ( c(X1) % 0.54/0.65 | ~ e(X1) ) ). % 0.54/0.65 % 0.54/0.65 cnf(clause_16,axiom, % 0.54/0.65 ( e(X1) % 0.54/0.65 | ~ c(X1) % 0.54/0.65 | ~ d(X1) ) ). % 0.54/0.65 % 0.54/0.65 %-------------------------------------------------------------------------- % 0.54/0.65 %------------------------------------------- % 0.54/0.65 % Proof found % 0.54/0.65 % SZS status Theorem for theBenchmark % 0.54/0.65 % SZS output start Proof % 0.54/0.65 %ClaNum:16(EqnAxiom:0) % 0.54/0.65 %VarNum:47(SingletonVarNum:19) % 0.54/0.65 %MaxLitNum:4 % 0.54/0.65 %MaxfuncDepth:1 % 0.54/0.65 %SharedTerms:2 % 0.54/0.65 %goalClause: 1 % 0.54/0.65 %singleGoalClaCount:1 % 0.54/0.65 [1]P1(a1) % 0.54/0.65 [2]~P2(x21)+P4(x21) % 0.54/0.65 [3]~P1(x31)+P2(x31) % 0.54/0.65 [4]~P4(x41)+P2(x41) % 0.54/0.65 [5]~P3(x51)+P5(x51) % 0.54/0.65 [6]~P1(x61)+P3(x61) % 0.54/0.65 [7]~P5(x71)+P3(x71) % 0.54/0.65 [9]P5(x91)+P6(x91,f2(x91)) % 0.54/0.65 [10]P5(x101)+P6(x101,f3(x101)) % 0.54/0.65 [11]~P4(x111)+P6(x111,f4(x111)) % 0.54/0.65 [12]~P4(x121)+P6(x121,f5(x121)) % 0.54/0.65 [13]P5(x131)+~P7(f2(x131),f3(x131)) % 0.54/0.65 [14]~P4(x141)+~P7(f4(x141),f5(x141)) % 0.54/0.65 [8]~P2(x81)+~P3(x81)+P1(x81) % 0.54/0.65 [15]~P6(x151,x153)+~P6(x151,x152)+P4(x151)+P7(x152,x153) % 0.54/0.65 [16]~P6(x163,x162)+~P6(x163,x161)+P7(x161,x162)+~P5(x163) % 0.54/0.65 %EqnAxiom % 0.54/0.65 % 0.54/0.65 %------------------------------------------- % 0.54/0.66 cnf(18,plain, % 0.54/0.66 (P4(a1)), % 0.54/0.66 inference(scs_inference,[],[1,3,2])). % 0.54/0.66 cnf(20,plain, % 0.54/0.66 (P5(a1)), % 0.54/0.66 inference(scs_inference,[],[1,6,5])). % 0.54/0.66 cnf(23,plain, % 0.54/0.66 (~P2(x231)+P6(x231,f4(x231))), % 0.54/0.66 inference(scs_inference,[],[11,2])). % 0.54/0.66 cnf(30,plain, % 0.54/0.66 (~P2(x301)+~P7(f4(x301),f5(x301))), % 0.54/0.66 inference(scs_inference,[],[14,2])). % 0.54/0.66 cnf(32,plain, % 0.54/0.66 (~P2(x321)+~P6(a1,f5(x321))+~P6(a1,f4(x321))), % 0.54/0.66 inference(scs_inference,[],[20,30,16])). % 0.54/0.66 cnf(34,plain, % 0.54/0.66 (~P6(a1,f5(a1))+~P6(a1,f4(a1))), % 0.54/0.66 inference(scs_inference,[],[1,32,3])). % 0.54/0.66 cnf(35,plain, % 0.54/0.66 (~P6(a1,f4(a1))), % 0.54/0.66 inference(scs_inference,[],[18,34,12])). % 0.54/0.66 cnf(38,plain, % 0.54/0.66 ($false), % 0.54/0.66 inference(scs_inference,[],[18,35,23,11]), % 0.54/0.66 ['proof']). % 0.54/0.66 % SZS output end Proof % 0.54/0.66 % Total time :0.040000s %------------------------------------------------------------------------------