TSTP Solution File: SYN323+1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN323+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n009.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 : Fri Sep 1 01:45:11 EDT 2023
% Result : Theorem 0.45s 0.62s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SYN323+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.12/0.33 % Computer : n009.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 : Sat Aug 26 18:34:35 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.45/0.57 start to proof:theBenchmark
% 0.45/0.61 %-------------------------------------------
% 0.45/0.61 % File :CSE---1.6
% 0.45/0.61 % Problem :theBenchmark
% 0.45/0.61 % Transform :cnf
% 0.45/0.61 % Format :tptp:raw
% 0.45/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.45/0.61
% 0.45/0.61 % Result :Theorem 0.000000s
% 0.45/0.61 % Output :CNFRefutation 0.000000s
% 0.45/0.61 %-------------------------------------------
% 0.45/0.61 %--------------------------------------------------------------------------
% 0.45/0.61 % File : SYN323+1 : TPTP v8.1.2. Released v2.0.0.
% 0.45/0.61 % Domain : Syntactic
% 0.45/0.61 % Problem : Church problem 46.4 (2)
% 0.45/0.61 % Version : Especial.
% 0.45/0.61 % English :
% 0.45/0.61
% 0.45/0.61 % Refs : [Chu56] Church (1956), Introduction to Mathematical Logic I
% 0.45/0.61 % Source : [Chu56]
% 0.45/0.61 % Names : 46.4 (2) [Chu56]
% 0.45/0.61
% 0.45/0.61 % Status : Theorem
% 0.45/0.61 % Rating : 0.00 v5.5.0, 0.11 v5.4.0, 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.00 v2.5.0, 0.33 v2.4.0, 0.33 v2.2.1, 0.00 v2.1.0
% 0.45/0.61 % Syntax : Number of formulae : 1 ( 0 unt; 0 def)
% 0.45/0.62 % Number of atoms : 6 ( 0 equ)
% 0.45/0.62 % Maximal formula atoms : 6 ( 6 avg)
% 0.45/0.62 % Number of connectives : 7 ( 2 ~; 0 |; 0 &)
% 0.45/0.62 % ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% 0.45/0.62 % Maximal formula depth : 7 ( 7 avg)
% 0.45/0.62 % Maximal term depth : 1 ( 1 avg)
% 0.45/0.62 % Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty)
% 0.45/0.62 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.45/0.62 % Number of variables : 3 ( 2 !; 1 ?)
% 0.45/0.62 % SPC : FOF_THM_EPR_NEQ
% 0.45/0.62
% 0.45/0.62 % Comments : The free variable is existentially quantified. Based on CNF.
% 0.45/0.62 %--------------------------------------------------------------------------
% 0.45/0.62 fof(church_46_4_2,conjecture,
% 0.45/0.62 ? [Y] :
% 0.45/0.62 ( ! [X] :
% 0.45/0.62 ( ( big_f(X,Y)
% 0.45/0.62 => big_f(Y,X) )
% 0.45/0.62 => big_g(X,Y) )
% 0.45/0.62 => ~ ! [X] :
% 0.45/0.62 ( ( big_f(X,Y)
% 0.45/0.62 => big_f(Y,X) )
% 0.45/0.62 => ~ big_g(X,Y) ) ) ).
% 0.45/0.62
% 0.45/0.62 %--------------------------------------------------------------------------
% 0.45/0.62 %-------------------------------------------
% 0.45/0.62 % Proof found
% 0.45/0.62 % SZS status Theorem for theBenchmark
% 0.45/0.62 % SZS output start Proof
% 0.45/0.62 %ClaNum:4(EqnAxiom:0)
% 0.45/0.62 %VarNum:16(SingletonVarNum:8)
% 0.45/0.62 %MaxLitNum:2
% 0.45/0.62 %MaxfuncDepth:0
% 0.45/0.62 %SharedTerms:0
% 0.45/0.62 %goalClause: 1 2 3 4
% 0.45/0.62 [1]P2(x11,x12)+P1(x11,x12)
% 0.45/0.62 [2]~P2(x21,x22)+P1(x21,x22)
% 0.45/0.62 [3]~P1(x32,x31)+P2(x31,x32)
% 0.45/0.62 [4]~P2(x42,x41)+~P1(x41,x42)
% 0.45/0.62 %EqnAxiom
% 0.45/0.62
% 0.45/0.62 %-------------------------------------------
% 0.45/0.62 cnf(8,plain,
% 0.45/0.62 (P1(x81,x82)),
% 0.45/0.62 inference(scs_inference,[],[1,2])).
% 0.45/0.62 cnf(11,plain,
% 0.45/0.62 ($false),
% 0.45/0.62 inference(scs_inference,[],[8,4,3]),
% 0.45/0.62 ['proof']).
% 0.45/0.62 % SZS output end Proof
% 0.45/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------