TSTP Solution File: SYN359+1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SYN359+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 : 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 : Fri Sep 1 01:45:25 EDT 2023
% Result : Theorem 0.20s 0.61s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN359+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 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 : Sat Aug 26 17:51:45 EDT 2023
% 0.20/0.34 % CPUTime :
% 0.20/0.56 start to proof:theBenchmark
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % File :CSE---1.6
% 0.20/0.61 % Problem :theBenchmark
% 0.20/0.61 % Transform :cnf
% 0.20/0.61 % Format :tptp:raw
% 0.20/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.61
% 0.20/0.61 % Result :Theorem 0.000000s
% 0.20/0.61 % Output :CNFRefutation 0.000000s
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 %--------------------------------------------------------------------------
% 0.20/0.61 % File : SYN359+1 : TPTP v8.1.2. Released v2.0.0.
% 0.20/0.61 % Domain : Syntactic
% 0.20/0.61 % Problem : Peter Andrews Problem X2110
% 0.20/0.61 % Version : Especial.
% 0.20/0.61 % English :
% 0.20/0.61
% 0.20/0.61 % Refs : [And86] Andrews (1986), An Introduction to Mathematical Logic
% 0.20/0.61 % : [And94] Andrews (1994), Email to G. Sutcliffe
% 0.20/0.61 % Source : [And94]
% 0.20/0.61 % Names : X2110 [And86]
% 0.20/0.61
% 0.20/0.61 % Status : Theorem
% 0.20/0.61 % Rating : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v3.2.0, 0.22 v3.1.0, 0.00 v2.5.0, 0.33 v2.4.0, 0.33 v2.2.1, 0.00 v2.1.0
% 0.20/0.61 % Syntax : Number of formulae : 1 ( 0 unt; 0 def)
% 0.20/0.61 % Number of atoms : 7 ( 0 equ)
% 0.20/0.61 % Maximal formula atoms : 7 ( 7 avg)
% 0.20/0.61 % Number of connectives : 6 ( 0 ~; 0 |; 3 &)
% 0.20/0.61 % ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% 0.20/0.61 % Maximal formula depth : 7 ( 7 avg)
% 0.20/0.61 % Maximal term depth : 1 ( 1 avg)
% 0.20/0.61 % Number of predicates : 2 ( 2 usr; 0 prp; 1-2 aty)
% 0.20/0.61 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.20/0.61 % Number of variables : 7 ( 3 !; 4 ?)
% 0.20/0.61 % SPC : FOF_THM_RFO_NEQ
% 0.20/0.61
% 0.20/0.61 % Comments :
% 0.20/0.61 %--------------------------------------------------------------------------
% 0.20/0.61 fof(x2110,conjecture,
% 0.20/0.61 ( ( ? [X] : big_r(X)
% 0.20/0.61 & ! [Y] :
% 0.20/0.61 ( big_r(Y)
% 0.20/0.61 => ? [Z] : big_q(Y,Z) )
% 0.20/0.61 & ! [X,Y] :
% 0.20/0.61 ( big_q(X,Y)
% 0.20/0.61 => big_q(X,X) ) )
% 0.20/0.61 => ? [X,Y] :
% 0.20/0.61 ( big_q(X,Y)
% 0.20/0.61 & big_r(Y) ) ) ).
% 0.20/0.61
% 0.20/0.61 %--------------------------------------------------------------------------
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % Proof found
% 0.20/0.61 % SZS status Theorem for theBenchmark
% 0.20/0.61 % SZS output start Proof
% 0.20/0.61 %ClaNum:4(EqnAxiom:0)
% 0.20/0.61 %VarNum:10(SingletonVarNum:5)
% 0.20/0.61 %MaxLitNum:2
% 0.20/0.61 %MaxfuncDepth:1
% 0.20/0.61 %SharedTerms:2
% 0.20/0.61 %goalClause: 1 2 3 4
% 0.20/0.61 %singleGoalClaCount:1
% 0.20/0.61 [1]P1(a1)
% 0.20/0.61 [2]~P1(x21)+P2(x21,f2(x21))
% 0.20/0.61 [3]~P1(x31)+~P2(x32,x31)
% 0.20/0.61 [4]P2(x41,x41)+~P2(x41,x42)
% 0.20/0.61 %EqnAxiom
% 0.20/0.61
% 0.20/0.61 %-------------------------------------------
% 0.20/0.62 cnf(7,plain,
% 0.20/0.62 ($false),
% 0.20/0.62 inference(scs_inference,[],[1,3,2,4]),
% 0.20/0.62 ['proof']).
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------