%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : MGT115+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n019.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:04:26 AM UTC 2026 % Result : Theorem 0.13s 0.46s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT115+1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.03 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.08/0.34 % Computer : n019.cluster.edu % 0.08/0.34 % Model : x86_64 x86_64 % 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.34 % Memory : 8046.5625MB % 0.08/0.34 % OS : Linux 6.8.0-71-generic % 0.08/0.34 % CPULimit : 300 % 0.08/0.34 % WCLimit : 300 % 0.08/0.34 % DateTime : Mon Sep 7 14:09:07 UTC 2026 % 0.08/0.34 % CPUTime : % 0.13/0.45 start to proof:theBenchmark % 0.13/0.45 %------------------------------------------- % 0.13/0.45 % File :CSE---1.7 % 0.13/0.45 % Problem :theBenchmark % 0.13/0.45 % Transform :cnf % 0.13/0.45 % Format :tptp:raw % 0.13/0.45 % Command :java -jar mcs_scs.jar %d %s % 0.13/0.45 % 0.13/0.45 % Result :Theorem 0.003765s % 0.13/0.45 % Output :CNFRefutation 0.003765s % 0.13/0.45 %------------------------------------------- % 0.13/0.46 %-------------------------------------------------------------------------- % 0.13/0.46 % File : MGT115+1 : TPTP v9.3.0. Released v9.3.0. % 0.13/0.46 % Domain : Management % 0.13/0.46 % Problem : issue/1 injectivity (distinct rules => distinct acts) % 0.13/0.46 % Version : Especial. % 0.13/0.46 % English : Two distinct rules pi1 != pi2. % 0.13/0.46 % Layer0 issue_injective: issue(A)=issue(B) => A=B. % 0.13/0.46 % Conjecture (FOF): issue(pi1) != issue(pi2). % 0.13/0.46 % Injectivity forces pi1=pi2 => contradiction with distinctness. % 0.13/0.46 % 0.13/0.46 % Refs : [MC+26] Mustafa et al. (2026), Axis Decomposition for ODRL % 0.13/0.46 % Source : [MC+26] % 0.13/0.46 % Names : GRND023-policy-issuance-1.p [MC+26] % 0.13/0.46 % 0.13/0.46 % Status : Theorem % 0.13/0.46 % Rating : 0.00 v9.3.0 % 0.13/0.46 % Syntax : Number of formulae : 5 ( 4 unt; 0 def) % 0.13/0.46 % Number of atoms : 6 ( 4 equ) % 0.13/0.46 % Maximal formula atoms : 2 ( 1 avg) % 0.13/0.46 % Number of connectives : 3 ( 2 ~; 0 |; 0 &) % 0.13/0.46 % ( 0 <=>; 1 =>; 0 <=; 0 <~>) % 0.13/0.46 % Maximal formula depth : 4 ( 2 avg) % 0.13/0.46 % Maximal term depth : 2 ( 1 avg) % 0.13/0.46 % Number of predicates : 2 ( 1 usr; 0 prp; 1-2 aty) % 0.13/0.46 % Number of functors : 3 ( 3 usr; 2 con; 0-1 aty) % 0.13/0.46 % Number of variables : 2 ( 2 !; 0 ?) % 0.13/0.46 % SPC : FOF_THM_RFO_SEQ % 0.13/0.46 % 0.13/0.46 % Comments : % 0.13/0.46 %-------------------------------------------------------------------------- % 0.13/0.46 fof(issue_injective,axiom, % 0.13/0.46 ! [A,B] : % 0.13/0.46 ( issue(A) = issue(B) % 0.13/0.46 => A = B ) ). % 0.13/0.46 % 0.13/0.46 %----Layer 1: Problem-specific axioms (subset of Ax5.1-5.11, A1-A3, B1-B3) % 0.13/0.46 %----Ground instance (gamma) % 0.13/0.46 fof(rule_pi1,axiom, % 0.13/0.46 rule(pi1) ). % 0.13/0.46 % 0.13/0.46 fof(rule_pi2,axiom, % 0.13/0.46 rule(pi2) ). % 0.13/0.46 % 0.13/0.46 fof(pi1_neq_pi2,axiom, % 0.13/0.46 pi1 != pi2 ). % 0.13/0.46 % 0.13/0.46 fof(conjecture,conjecture, % 0.13/0.46 issue(pi1) != issue(pi2) ). % 0.13/0.46 % 0.13/0.46 %-------------------------------------------------------------------------- % 0.13/0.46 %------------------------------------------- % 0.13/0.46 % Proof found % 0.13/0.46 % SZS status Theorem for theBenchmark % 0.13/0.46 % SZS output start Proof % 0.29/0.46 %ClaNum:10(EqnAxiom:5) % 0.29/0.46 %VarNum:4(SingletonVarNum:2) % 0.29/0.46 %MaxLitNum:2 % 0.29/0.46 %MaxfuncDepth:1 % 0.29/0.46 %SharedTerms:8 % 0.29/0.46 %goalClause: 8 % 0.29/0.46 %singleGoalClaCount:1 % 0.29/0.46 [6]P1(a1) % 0.29/0.46 [7]P1(a3) % 0.29/0.46 [9]~E(a1,a3) % 0.29/0.46 [8]E(f2(a1),f2(a3)) % 0.29/0.46 [10]E(x101,x102)+~E(f2(x101),f2(x102)) % 0.29/0.46 %EqnAxiom % 0.29/0.46 [1]E(x11,x11) % 0.29/0.46 [2]E(x22,x21)+~E(x21,x22) % 0.29/0.46 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.29/0.46 [4]~E(x41,x42)+E(f2(x41),f2(x42)) % 0.29/0.46 [5]~P1(x51)+P1(x52)+~E(x51,x52) % 0.29/0.46 % 0.29/0.46 %------------------------------------------- % 0.29/0.46 cnf(12,plain, % 0.29/0.46 ($false), % 0.29/0.46 inference(scs_inference,[],[9,8,10]), % 0.29/0.46 ['proof']). % 0.29/0.46 % SZS output end Proof % 0.29/0.46 % Total time :0.003765s %------------------------------------------------------------------------------