%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN920+1 : TPTP v8.2.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n018.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 19:07:21 EDT 2024 % Result : Theorem 0.62s 0.70s % Output : CNFRefutation 0.62s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SYN920+1 : TPTP v8.2.0. Released v3.1.0. % 0.03/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.13/0.34 % Computer : n018.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 : Sun Jun 23 21:07:09 EDT 2024 % 0.13/0.34 % CPUTime : % 0.62/0.63 start to proof:theBenchmark % 0.62/0.69 %------------------------------------------- % 0.62/0.69 % File :CSE---1.7 % 0.62/0.69 % Problem :theBenchmark % 0.62/0.69 % Transform :cnf % 0.62/0.69 % Format :tptp:raw % 0.62/0.69 % Command :java -jar mcs_scs.jar %d %s % 0.62/0.70 % 0.62/0.70 % Result :Theorem 0.020000s % 0.62/0.70 % Output :CNFRefutation 0.020000s % 0.62/0.70 %------------------------------------------- % 0.62/0.70 %-------------------------------------------------------------------------- % 0.62/0.70 % File : SYN920+1 : TPTP v8.2.0. Released v3.1.0. % 0.62/0.70 % Domain : Syntactic % 0.62/0.70 % Problem : From Smullyan % 0.62/0.70 % Version : Especial. % 0.62/0.70 % English : % 0.62/0.70 % 0.62/0.70 % Refs : [Smu68] Smullyan (1968), First-Order Logic % 0.62/0.70 % [Shu04] Shults (2004), Email to G. Sutcliffe % 0.62/0.70 % Source : [Shu04] % 0.62/0.70 % Names : % 0.62/0.70 % 0.62/0.70 % Status : Theorem % 0.62/0.70 % Rating : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v4.1.0, 0.06 v4.0.1, 0.05 v3.7.0, 0.33 v3.5.0, 0.12 v3.4.0, 0.08 v3.3.0, 0.00 v3.2.0, 0.11 v3.1.0 % 0.62/0.70 % Syntax : Number of formulae : 1 ( 0 unt; 0 def) % 0.62/0.70 % Number of atoms : 15 ( 0 equ) % 0.62/0.70 % Maximal formula atoms : 15 ( 15 avg) % 0.62/0.70 % Number of connectives : 16 ( 2 ~; 1 |; 6 &) % 0.62/0.70 % ( 0 <=>; 7 =>; 0 <=; 0 <~>) % 0.62/0.70 % Maximal formula depth : 7 ( 7 avg) % 0.62/0.70 % Maximal term depth : 1 ( 1 avg) % 0.62/0.70 % Number of predicates : 3 ( 3 usr; 0 prp; 1-1 aty) % 0.62/0.70 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.62/0.70 % Number of variables : 6 ( 4 !; 2 ?) % 0.62/0.70 % SPC : FOF_THM_EPR_NEQ % 0.62/0.70 % 0.62/0.70 % Comments : % 0.62/0.70 %-------------------------------------------------------------------------- % 0.62/0.70 fof(prove_this,conjecture, % 0.62/0.70 ( ( ( ! [X] : % 0.62/0.70 ( ( f(X) % 0.62/0.70 & g(X) ) % 0.62/0.70 => h(X) ) % 0.62/0.70 => ? [X] : % 0.62/0.70 ( f(X) % 0.62/0.70 & ~ g(X) ) ) % 0.62/0.70 & ( ! [W] : % 0.62/0.70 ( f(W) % 0.62/0.70 => g(W) ) % 0.62/0.70 | ! [Z] : % 0.62/0.70 ( f(Z) % 0.62/0.70 => h(Z) ) ) ) % 0.62/0.70 => ( ! [R] : % 0.62/0.70 ( ( f(R) % 0.62/0.70 & h(R) ) % 0.62/0.70 => g(R) ) % 0.62/0.70 => ? [V] : % 0.62/0.70 ( f(V) % 0.62/0.70 & g(V) % 0.62/0.70 & ~ h(V) ) ) ) ). % 0.62/0.70 % 0.62/0.70 %-------------------------------------------------------------------------- % 0.62/0.70 %------------------------------------------- % 0.62/0.70 % Proof found % 0.62/0.70 % SZS status Theorem for theBenchmark % 0.62/0.70 % SZS output start Proof % 0.62/0.70 %ClaNum:9(EqnAxiom:0) % 0.62/0.70 %VarNum:10(SingletonVarNum:4) % 0.62/0.70 %MaxLitNum:4 % 0.62/0.70 %MaxfuncDepth:0 % 0.62/0.70 %SharedTerms:7 % 0.62/0.70 %goalClause: 1 2 3 4 5 6 7 8 9 % 0.62/0.70 [1]P1(a1)+P1(a2) % 0.62/0.70 [2]P1(a2)+P2(a1) % 0.62/0.70 [3]P1(a1)+~P2(a2) % 0.62/0.70 [4]P1(a2)+~P3(a1) % 0.62/0.70 [5]P2(a1)+~P2(a2) % 0.62/0.70 [6]~P2(a2)+~P3(a1) % 0.62/0.70 [7]~P1(x71)+~P3(x71)+P2(x71) % 0.62/0.70 [8]~P1(x81)+~P2(x81)+P3(x81) % 0.62/0.70 [9]~P1(x92)+~P1(x91)+P2(x91)+P3(x92) % 0.62/0.70 %EqnAxiom % 0.62/0.70 % 0.62/0.70 %------------------------------------------- % 0.62/0.71 cnf(12,plain, % 0.62/0.71 (~P2(a1)+P3(a1)+~P2(a2)), % 0.62/0.71 inference(scs_inference,[],[3,8])). % 0.62/0.71 cnf(13,plain, % 0.62/0.71 (~P3(a2)+P2(a2)+~P3(a1)), % 0.62/0.71 inference(scs_inference,[],[4,7])). % 0.62/0.71 cnf(16,plain, % 0.62/0.71 (P3(a1)+~P2(a2)), % 0.62/0.71 inference(scs_inference,[],[12,5])). % 0.62/0.71 cnf(19,plain, % 0.62/0.71 (~P3(a2)+~P3(a1)), % 0.62/0.71 inference(scs_inference,[],[13,6])). % 0.62/0.71 cnf(20,plain, % 0.62/0.71 (~P3(a2)+~P2(a2)), % 0.62/0.71 inference(scs_inference,[],[19,16])). % 0.62/0.71 cnf(21,plain, % 0.62/0.71 (~P2(a2)+~P1(a2)), % 0.62/0.71 inference(scs_inference,[],[20,8])). % 0.62/0.71 cnf(29,plain, % 0.62/0.71 (P3(a1)+~P1(a1)+P1(a2)), % 0.62/0.71 inference(scs_inference,[],[2,8])). % 0.62/0.71 cnf(30,plain, % 0.62/0.71 (~P1(a1)+P1(a2)), % 0.62/0.71 inference(scs_inference,[],[29,4])). % 0.62/0.71 cnf(31,plain, % 0.62/0.71 (P1(a2)), % 0.62/0.71 inference(scs_inference,[],[30,1])). % 0.62/0.71 cnf(32,plain, % 0.62/0.71 (~P2(a2)), % 0.62/0.71 inference(scs_inference,[],[31,21])). % 0.62/0.71 cnf(34,plain, % 0.62/0.71 (P2(a2)+~P3(a2)), % 0.62/0.71 inference(scs_inference,[],[31,7])). % 0.62/0.71 cnf(42,plain, % 0.62/0.71 ($false), % 0.62/0.71 inference(scs_inference,[],[31,32,34,9]), % 0.62/0.71 ['proof']). % 0.62/0.71 % SZS output end Proof % 0.62/0.71 % Total time :0.020000s %------------------------------------------------------------------------------