%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SEU167+3 : TPTP v8.2.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n022.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 15:01:30 EDT 2024 % Result : Theorem 0.56s 0.65s % Output : CNFRefutation 0.56s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SEU167+3 : TPTP v8.2.0. Released v3.2.0. % 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.14/0.34 % Computer : n022.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Fri Jun 21 12:49:39 EDT 2024 % 0.14/0.34 % CPUTime : % 0.56/0.58 start to proof:theBenchmark % 0.56/0.65 %------------------------------------------- % 0.56/0.65 % File :CSE---1.7 % 0.56/0.65 % Problem :theBenchmark % 0.56/0.65 % Transform :cnf % 0.56/0.65 % Format :tptp:raw % 0.56/0.65 % Command :java -jar mcs_scs.jar %d %s % 0.56/0.65 % 0.56/0.65 % Result :Theorem 0.020000s % 0.56/0.65 % Output :CNFRefutation 0.020000s % 0.56/0.65 %------------------------------------------- % 0.56/0.65 %------------------------------------------------------------------------------ % 0.56/0.65 % File : SEU167+3 : TPTP v8.2.0. Released v3.2.0. % 0.56/0.65 % Domain : Set theory % 0.56/0.65 % Problem : Basic properties of sets, theorem 119 % 0.56/0.65 % Version : [Urb06] axioms : Especial. % 0.56/0.65 % English : % 0.56/0.65 % 0.56/0.65 % Refs : [Byl90] Bylinski (1990), Some Basic Properties of Sets % 0.56/0.65 % : [Urb06] Urban (2006), Email to G. Sutcliffe % 0.56/0.65 % Source : [Urb06] % 0.56/0.65 % Names : zfmisc_1__t119_zfmisc_1 [Urb06] % 0.56/0.65 % 0.56/0.65 % Status : Theorem % 0.56/0.65 % Rating : 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v6.0.0, 0.25 v5.5.0, 0.12 v5.4.0, 0.04 v5.3.0, 0.13 v5.2.0, 0.00 v3.2.0 % 0.56/0.65 % Syntax : Number of formulae : 6 ( 3 unt; 0 def) % 0.56/0.65 % Number of atoms : 12 ( 0 equ) % 0.56/0.65 % Maximal formula atoms : 3 ( 2 avg) % 0.56/0.65 % Number of connectives : 7 ( 1 ~; 0 |; 3 &) % 0.56/0.65 % ( 0 <=>; 3 =>; 0 <=; 0 <~>) % 0.56/0.65 % Maximal formula depth : 7 ( 5 avg) % 0.56/0.65 % Maximal term depth : 2 ( 1 avg) % 0.56/0.65 % Number of predicates : 2 ( 2 usr; 0 prp; 1-2 aty) % 0.56/0.65 % Number of functors : 1 ( 1 usr; 0 con; 2-2 aty) % 0.56/0.65 % Number of variables : 14 ( 12 !; 2 ?) % 0.56/0.65 % SPC : FOF_THM_RFO_NEQ % 0.56/0.65 % 0.56/0.65 % Comments : Translated by MPTP 0.2 from the original problem in the Mizar % 0.56/0.65 % library, www.mizar.org % 0.56/0.65 %------------------------------------------------------------------------------ % 0.56/0.65 fof(rc1_xboole_0,axiom, % 0.56/0.65 ? [A] : empty(A) ). % 0.56/0.65 % 0.56/0.65 fof(rc2_xboole_0,axiom, % 0.56/0.65 ? [A] : ~ empty(A) ). % 0.56/0.65 % 0.56/0.65 fof(reflexivity_r1_tarski,axiom, % 0.56/0.65 ! [A,B] : subset(A,A) ). % 0.56/0.65 % 0.56/0.65 fof(t118_zfmisc_1,axiom, % 0.56/0.65 ! [A,B,C] : % 0.56/0.65 ( subset(A,B) % 0.56/0.65 => ( subset(cartesian_product2(A,C),cartesian_product2(B,C)) % 0.56/0.65 & subset(cartesian_product2(C,A),cartesian_product2(C,B)) ) ) ). % 0.56/0.65 % 0.56/0.65 fof(t119_zfmisc_1,conjecture, % 0.56/0.65 ! [A,B,C,D] : % 0.56/0.65 ( ( subset(A,B) % 0.56/0.65 & subset(C,D) ) % 0.56/0.65 => subset(cartesian_product2(A,C),cartesian_product2(B,D)) ) ). % 0.56/0.65 % 0.56/0.65 fof(t1_xboole_1,axiom, % 0.56/0.65 ! [A,B,C] : % 0.56/0.65 ( ( subset(A,B) % 0.56/0.65 & subset(B,C) ) % 0.56/0.65 => subset(A,C) ) ). % 0.56/0.65 % 0.56/0.65 %------------------------------------------------------------------------------ % 0.56/0.65 %------------------------------------------- % 0.56/0.65 % Proof found % 0.56/0.65 % SZS status Theorem for theBenchmark % 0.56/0.65 % SZS output start Proof % 0.56/0.66 %ClaNum:9(EqnAxiom:0) % 0.56/0.66 %VarNum:20(SingletonVarNum:10) % 0.56/0.66 %MaxLitNum:3 % 0.56/0.66 %MaxfuncDepth:1 % 0.56/0.66 %SharedTerms:13 % 0.56/0.66 %goalClause: 2 3 6 % 0.56/0.66 %singleGoalClaCount:3 % 0.56/0.66 [1]P1(a1) % 0.56/0.66 [2]P2(a3,a5) % 0.56/0.66 [3]P2(a6,a7) % 0.56/0.66 [5]~P1(a4) % 0.56/0.66 [6]~P2(f2(a3,a6),f2(a5,a7)) % 0.56/0.66 [4]P2(x41,x41) % 0.56/0.66 [8]~P2(x81,x83)+P2(f2(x81,x82),f2(x83,x82)) % 0.56/0.66 [9]~P2(x92,x93)+P2(f2(x91,x92),f2(x91,x93)) % 0.56/0.66 [7]~P2(x71,x73)+P2(x71,x72)+~P2(x73,x72) % 0.56/0.66 %EqnAxiom % 0.56/0.66 % 0.56/0.66 %------------------------------------------- % 0.56/0.66 cnf(11,plain, % 0.56/0.66 (P2(f2(a3,x111),f2(a5,x111))), % 0.56/0.66 inference(scs_inference,[],[2,4,7,8])). % 0.56/0.66 cnf(24,plain, % 0.56/0.66 (P2(f2(x241,a6),f2(x241,a7))), % 0.56/0.66 inference(scs_inference,[],[3,4,7,9])). % 0.56/0.66 cnf(31,plain, % 0.56/0.66 ($false), % 0.56/0.66 inference(scs_inference,[],[11,6,24,7]), % 0.56/0.66 ['proof']). % 0.56/0.66 % SZS output end Proof % 0.56/0.66 % Total time :0.020000s %------------------------------------------------------------------------------