TSTP Solution File: SET025-9 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : SET025-9 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n007.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  : 600s
% DateTime : Tue Jul 19 04:57:43 EDT 2022

% Result   : Unsatisfiable 1.83s 0.57s
% Output   : Proof 1.83s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ little_set(a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_predicate_is_small)]) ).

cnf(g1,plain,
    ordered_pair_predicate(a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',an_ordered_pair_predicate)]) ).

cnf(g2,plain,
    ( ~ ordered_pair_predicate(a)
    | sPE(a,ordered_pair(f2(a),f3(a))) ),
    inference(ground_cnf,[],[file('Axioms/SET003-0.ax',ordered_pair_predicate3)]) ).

cnf(g3,plain,
    ( ~ sPE(non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a))),a)
    | ~ little_set(non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a))))
    | little_set(a) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    little_set(non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a)))),
    inference(ground_cnf,[],[file('Axioms/SET003-0.ax',non_ordered_pair4)]) ).

cnf(g5,plain,
    ( ~ sPE(a,non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a))))
    | sPE(non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a))),a) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    ( ~ sPE(a,ordered_pair(f2(a),f3(a)))
    | ~ sPE(ordered_pair(f2(a),f3(a)),non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a))))
    | sPE(a,non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g7,plain,
    sPE(ordered_pair(f2(a),f3(a)),non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a)))),
    inference(ground_cnf,[],[file('Axioms/SET003-0.ax',ordered_pair)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET025-9 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12  % Command  : satcop --statistics %s
% 0.12/0.33  % Computer : n007.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  : 600
% 0.12/0.33  % DateTime : Sun Jul 10 16:54:17 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.83/0.57  % symbols: 75
% 1.83/0.57  % clauses: 212
% 1.83/0.57  % start clauses: 1
% 1.83/0.57  % iterative deepening steps: 932
% 1.83/0.57  % maximum path limit: 4
% 1.83/0.57  % literal attempts: 499665
% 1.83/0.57  % depth failures: 388822
% 1.83/0.57  % regularity failures: 52953
% 1.83/0.57  % tautology failures: 2410
% 1.83/0.57  % reductions: 14494
% 1.83/0.57  % extensions: 484569
% 1.83/0.57  % SAT variables: 117071
% 1.83/0.57  % SAT clauses: 134073
% 1.83/0.57  % WalkSAT solutions: 134074
% 1.83/0.57  % CDCL solutions: 0
% 1.83/0.57  % SZS status Unsatisfiable for theBenchmark
% 1.83/0.57  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------