%------------------------------------------------------------------------------
% File : CSE---1.7
% Problem : TOP002-2 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n016.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 21:15:03 EDT 2024
% Result : Unsatisfiable 0.19s 0.60s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : TOP002-2 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n016.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 : Tue Jun 18 11:24:24 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.56 start to proof:theBenchmark
% 0.19/0.60 %-------------------------------------------
% 0.19/0.60 % File :CSE---1.7
% 0.19/0.60 % Problem :theBenchmark
% 0.19/0.60 % Transform :cnf
% 0.19/0.60 % Format :tptp:raw
% 0.19/0.60 % Command :java -jar mcs_scs.jar %d %s
% 0.19/0.60
% 0.19/0.60 % Result :Theorem 0.000000s
% 0.19/0.60 % Output :CNFRefutation 0.000000s
% 0.19/0.60 %-------------------------------------------
% 0.19/0.60 %--------------------------------------------------------------------------
% 0.19/0.60 % File : TOP002-2 : TPTP v8.2.0. Released v1.0.0.
% 0.19/0.60 % Domain : Topology
% 0.19/0.60 % Problem : Topology generated by a basis forms a topological space, part 2
% 0.19/0.60 % Version : [WM89] axioms : Incomplete > Reduced & Augmented > Incomplete.
% 0.19/0.60 % English :
% 0.19/0.60
% 0.19/0.60 % Refs : [WM89] Wick & McCune (1989), Automated Reasoning about Elemen
% 0.19/0.60 % Source : [WM89]
% 0.19/0.60 % Names : Lemma 1b [WM89]
% 0.19/0.60
% 0.19/0.60 % Status : Unsatisfiable
% 0.19/0.60 % Rating : 0.00 v6.3.0, 0.14 v6.2.0, 0.00 v2.0.0
% 0.19/0.60 % Syntax : Number of clauses : 3 ( 2 unt; 1 nHn; 2 RR)
% 0.19/0.60 % Number of literals : 4 ( 0 equ; 2 neg)
% 0.19/0.60 % Maximal clause size : 2 ( 1 avg)
% 0.19/0.60 % Maximal term depth : 2 ( 1 avg)
% 0.19/0.60 % Number of predicates : 2 ( 2 usr; 0 prp; 2-2 aty)
% 0.19/0.60 % Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% 0.19/0.60 % Number of variables : 3 ( 1 sgn)
% 0.19/0.60 % SPC : CNF_UNS_RFO_NEQ_NHN
% 0.19/0.60
% 0.19/0.60 % Comments : The axioms in this version are known to be incomplete. To
% 0.19/0.60 % make them complete it is be necessary to add appropriate set
% 0.19/0.60 % theory axioms.
% 0.19/0.60 %--------------------------------------------------------------------------
% 0.19/0.60 %----Include Point-set topology axioms
% 0.19/0.60 % include('Axioms/TOP001-0.ax').
% 0.19/0.60 %--------------------------------------------------------------------------
% 0.19/0.60 %----Topology generated by a basis
% 0.19/0.60 cnf(topology_generated_40,axiom,
% 0.19/0.60 ( element_of_collection(U,top_of_basis(Vf))
% 0.19/0.60 | element_of_set(f11(Vf,U),U) ) ).
% 0.19/0.60
% 0.19/0.60 cnf(set_theory_6,axiom,
% 0.19/0.60 ~ element_of_set(X,empty_set) ).
% 0.19/0.60
% 0.19/0.60 %----Not used in the reduced version
% 0.19/0.60 % input_clause(lemma_1b_1,negated_conjecture,
% 0.19/0.60 % [++basis(cx,f)]).
% 0.19/0.60
% 0.19/0.60 cnf(lemma_1b_2,negated_conjecture,
% 0.19/0.60 ~ element_of_collection(empty_set,top_of_basis(f)) ).
% 0.19/0.60
% 0.19/0.60 %--------------------------------------------------------------------------
% 0.19/0.60 %-------------------------------------------
% 0.19/0.60 % Proof found
% 0.19/0.60 % SZS status Theorem for theBenchmark
% 0.19/0.60 % SZS output start Proof
% 0.19/0.60 %ClaNum:3(EqnAxiom:0)
% 0.19/0.60 %VarNum:6(SingletonVarNum:3)
% 0.19/0.60 %MaxLitNum:2
% 0.19/0.60 %MaxfuncDepth:1
% 0.19/0.60 %SharedTerms:4
% 0.19/0.60 %goalClause: 2
% 0.19/0.60 %singleGoalClaCount:1
% 0.19/0.60 [2]~P2(a1,f3(a2))
% 0.19/0.60 [1]~P1(x11,a1)
% 0.19/0.60 [3]P1(f4(x32,x31),x31)+P2(x31,f3(x32))
% 0.19/0.60 %EqnAxiom
% 0.19/0.60
% 0.19/0.60 %-------------------------------------------
% 0.55/0.61 cnf(4,plain,
% 0.55/0.61 ($false),
% 0.55/0.61 inference(scs_inference,[],[1,2,3]),
% 0.55/0.61 ['proof']).
% 0.55/0.61 % SZS output end Proof
% 0.55/0.61 % Total time :0.000000s
%------------------------------------------------------------------------------