%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : KRS003-1 : TPTP v8.2.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n025.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.20s 0.60s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : KRS003-1 : TPTP v8.2.0. Released v2.0.0. % 0.10/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.13/0.33 % Computer : n025.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Wed Jun 19 14:23:24 EDT 2024 % 0.13/0.33 % CPUTime : % 0.20/0.55 start to proof:theBenchmark % 0.20/0.59 %------------------------------------------- % 0.20/0.59 % File :CSE---1.7 % 0.20/0.59 % Problem :theBenchmark % 0.20/0.59 % Transform :cnf % 0.20/0.59 % Format :tptp:raw % 0.20/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.20/0.59 % 0.20/0.59 % Result :Theorem 0.010000s % 0.20/0.59 % Output :CNFRefutation 0.010000s % 0.20/0.59 %------------------------------------------- % 0.20/0.60 %-------------------------------------------------------------------------- % 0.20/0.60 % File : KRS003-1 : TPTP v8.2.0. Released v2.0.0. % 0.20/0.60 % Domain : Knowledge Representation % 0.20/0.60 % Problem : Paramasivam problem T-Box 1c % 0.20/0.60 % Version : Especial. % 0.20/0.60 % English : e and f exist. % 0.20/0.60 % 0.20/0.60 % Refs : [PP95] Paramasivam & Plaisted (1995), Automated Deduction Tec % 0.20/0.60 % Source : [PP95] % 0.20/0.60 % Names : Problem 1(c) [PP95] % 0.20/0.60 % 0.20/0.60 % Status : Unsatisfiable % 0.20/0.60 % Rating : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.00 v2.1.0 % 0.20/0.60 % Syntax : Number of clauses : 16 ( 2 unt; 3 nHn; 14 RR) % 0.20/0.60 % Number of literals : 34 ( 0 equ; 16 neg) % 0.20/0.60 % Maximal clause size : 4 ( 2 avg) % 0.20/0.60 % Maximal term depth : 2 ( 1 avg) % 0.20/0.60 % Number of predicates : 8 ( 8 usr; 0 prp; 1-2 aty) % 0.20/0.60 % Number of functors : 5 ( 5 usr; 1 con; 0-1 aty) % 0.20/0.60 % Number of variables : 18 ( 0 sgn) % 0.20/0.60 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.20/0.60 % 0.20/0.60 % Comments : % 0.20/0.60 %-------------------------------------------------------------------------- % 0.20/0.60 cnf(clause_1,negated_conjecture, % 0.20/0.60 e(exist) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_2,negated_conjecture, % 0.20/0.60 f(exist) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_3,axiom, % 0.20/0.60 ( s2least(X1) % 0.20/0.60 | ~ c(X1) ) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_4,axiom, % 0.20/0.60 ( c(X1) % 0.20/0.60 | ~ s2least(X1) ) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_5,axiom, % 0.20/0.60 ( ~ s2least(X1) % 0.20/0.60 | ~ equalish(u1r2(X1),u1r1(X1)) ) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_6,axiom, % 0.20/0.60 ( s(X1,u1r1(X1)) % 0.20/0.60 | ~ s2least(X1) ) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_7,axiom, % 0.20/0.60 ( s(X1,u1r2(X1)) % 0.20/0.60 | ~ s2least(X1) ) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_8,axiom, % 0.20/0.60 ( s2least(X1) % 0.20/0.60 | equalish(X3,X2) % 0.20/0.60 | ~ s(X1,X3) % 0.20/0.60 | ~ s(X1,X2) ) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_9,axiom, % 0.20/0.60 ( s1most(X1) % 0.20/0.60 | ~ d(X1) ) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_10,axiom, % 0.20/0.60 ( d(X1) % 0.20/0.60 | ~ s1most(X1) ) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_11,axiom, % 0.20/0.60 ( equalish(X3,X2) % 0.20/0.60 | ~ s1most(X1) % 0.20/0.60 | ~ s(X1,X3) % 0.20/0.60 | ~ s(X1,X2) ) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_12,axiom, % 0.20/0.60 ( s1most(X1) % 0.20/0.60 | ~ equalish(u3r2(X1),u3r1(X1)) ) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_13,axiom, % 0.20/0.60 ( s1most(X1) % 0.20/0.60 | s(X1,u3r1(X1)) ) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_14,axiom, % 0.20/0.60 ( s1most(X1) % 0.20/0.60 | s(X1,u3r2(X1)) ) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_15,axiom, % 0.20/0.60 ( c(X1) % 0.20/0.60 | ~ e(X1) ) ). % 0.20/0.60 % 0.20/0.60 cnf(clause_16,axiom, % 0.20/0.60 ( d(X1) % 0.20/0.60 | ~ f(X1) ) ). % 0.20/0.60 % 0.20/0.60 %-------------------------------------------------------------------------- % 0.20/0.60 %------------------------------------------- % 0.20/0.60 % Proof found % 0.20/0.60 % SZS status Theorem for theBenchmark % 0.20/0.60 % SZS output start Proof % 0.20/0.60 %ClaNum:16(EqnAxiom:0) % 0.20/0.60 %VarNum:44(SingletonVarNum:18) % 0.20/0.60 %MaxLitNum:4 % 0.20/0.60 %MaxfuncDepth:1 % 0.20/0.60 %SharedTerms:3 % 0.20/0.60 %goalClause: 1 2 % 0.20/0.60 %singleGoalClaCount:2 % 0.20/0.60 [1]P1(a1) % 0.20/0.60 [2]P4(a1) % 0.20/0.60 [3]~P2(x31)+P6(x31) % 0.20/0.60 [4]~P1(x41)+P2(x41) % 0.20/0.60 [5]~P6(x51)+P2(x51) % 0.20/0.60 [6]~P3(x61)+P7(x61) % 0.20/0.60 [7]~P4(x71)+P3(x71) % 0.20/0.60 [8]~P7(x81)+P3(x81) % 0.20/0.60 [9]P7(x91)+P8(x91,f2(x91)) % 0.20/0.60 [10]P7(x101)+P8(x101,f3(x101)) % 0.20/0.60 [11]~P6(x111)+P8(x111,f4(x111)) % 0.20/0.60 [12]~P6(x121)+P8(x121,f5(x121)) % 0.20/0.60 [13]P7(x131)+~P5(f2(x131),f3(x131)) % 0.20/0.60 [14]~P6(x141)+~P5(f4(x141),f5(x141)) % 0.20/0.60 [15]~P8(x151,x153)+~P8(x151,x152)+P6(x151)+P5(x152,x153) % 0.20/0.60 [16]~P8(x163,x162)+~P8(x163,x161)+P5(x161,x162)+~P7(x163) % 0.20/0.60 %EqnAxiom % 0.20/0.60 % 0.20/0.60 %------------------------------------------- % 0.20/0.60 cnf(18,plain, % 0.20/0.60 (P6(a1)), % 0.20/0.60 inference(scs_inference,[],[1,4,3])). % 0.20/0.60 cnf(20,plain, % 0.20/0.60 (P7(a1)), % 0.20/0.60 inference(scs_inference,[],[2,7,6])). % 0.20/0.60 cnf(23,plain, % 0.20/0.60 (~P2(x231)+P8(x231,f4(x231))), % 0.20/0.60 inference(scs_inference,[],[11,3])). % 0.20/0.60 cnf(30,plain, % 0.20/0.60 (~P2(x301)+~P5(f4(x301),f5(x301))), % 0.20/0.60 inference(scs_inference,[],[14,3])). % 0.20/0.60 cnf(32,plain, % 0.20/0.60 (~P2(x321)+~P8(a1,f5(x321))+~P8(a1,f4(x321))), % 0.20/0.60 inference(scs_inference,[],[20,30,16])). % 0.20/0.60 cnf(34,plain, % 0.20/0.60 (~P8(a1,f5(a1))+~P8(a1,f4(a1))), % 0.20/0.60 inference(scs_inference,[],[1,32,4])). % 0.20/0.60 cnf(35,plain, % 0.20/0.60 (~P8(a1,f4(a1))), % 0.20/0.60 inference(scs_inference,[],[18,34,12])). % 0.20/0.60 cnf(38,plain, % 0.20/0.60 ($false), % 0.20/0.60 inference(scs_inference,[],[18,35,23,5]), % 0.20/0.60 ['proof']). % 0.20/0.60 % SZS output end Proof % 0.20/0.60 % Total time :0.010000s %------------------------------------------------------------------------------