%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : LAT042-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n020.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 : Sun Jul 17 06:38:35 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ sPE(join(a,meet(b,join(a,c))),meet(join(a,b),join(a,c))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_modular_law)]) ).

cnf(g1,plain,
    ( ~ sPE(meet(join(a,b),join(a,c)),join(a,meet(b,join(a,c))))
    | sPE(join(a,meet(b,join(a,c))),meet(join(a,b),join(a,c))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g2,plain,
    sPE(meet(join(a,b),join(a,c)),meet(join(a,c),join(a,b))),
    inference(ground_cnf,[],[file('Axioms/LAT001-0.ax',commutativity_of_meet)]) ).

cnf(g3,plain,
    sPE(meet(b,join(a,c)),meet(b,join(a,c))),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    sPE(meet(join(a,c),b),meet(b,join(a,c))),
    inference(ground_cnf,[],[file('Axioms/LAT001-0.ax',commutativity_of_meet)]) ).

cnf(g5,plain,
    ( ~ sPE(meet(join(a,b),join(a,c)),meet(join(a,c),join(a,b)))
    | ~ sPE(meet(join(a,c),join(a,b)),join(meet(join(a,c),a),meet(join(a,c),b)))
    | sPE(meet(join(a,b),join(a,c)),join(meet(join(a,c),a),meet(join(a,c),b))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g6,plain,
    sPE(meet(join(a,c),join(a,b)),join(meet(join(a,c),a),meet(join(a,c),b))),
    inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity)]) ).

cnf(g7,plain,
    sPE(meet(join(a,c),a),meet(a,join(a,c))),
    inference(ground_cnf,[],[file('Axioms/LAT001-0.ax',commutativity_of_meet)]) ).

cnf(g8,plain,
    ( ~ sPE(meet(join(a,b),join(a,c)),join(meet(a,join(a,c)),meet(b,join(a,c))))
    | ~ sPE(join(meet(a,join(a,c)),meet(b,join(a,c))),join(a,meet(b,join(a,c))))
    | sPE(meet(join(a,b),join(a,c)),join(a,meet(b,join(a,c)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g9,plain,
    ( ~ sPE(meet(join(a,b),join(a,c)),join(meet(join(a,c),a),meet(join(a,c),b)))
    | ~ sPE(join(meet(join(a,c),a),meet(join(a,c),b)),join(meet(a,join(a,c)),meet(b,join(a,c))))
    | sPE(meet(join(a,b),join(a,c)),join(meet(a,join(a,c)),meet(b,join(a,c)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g10,plain,
    ( ~ sPE(meet(join(a,c),a),meet(a,join(a,c)))
    | ~ sPE(meet(join(a,c),b),meet(b,join(a,c)))
    | sPE(join(meet(join(a,c),a),meet(join(a,c),b)),join(meet(a,join(a,c)),meet(b,join(a,c)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g11,plain,
    ( ~ sPE(meet(a,join(a,c)),a)
    | ~ sPE(meet(b,join(a,c)),meet(b,join(a,c)))
    | sPE(join(meet(a,join(a,c)),meet(b,join(a,c))),join(a,meet(b,join(a,c)))) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g12,plain,
    sPE(meet(a,join(a,c)),a),
    inference(ground_cnf,[],[file('Axioms/LAT001-0.ax',absorption1)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LAT042-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.13  % Command  : satcop --statistics %s
% 0.13/0.34  % Computer : n020.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  : 600
% 0.13/0.34  % DateTime : Tue Jun 28 19:23:16 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.43  % symbols: 10
% 0.19/0.43  % clauses: 19
% 0.19/0.43  % start clauses: 1
% 0.19/0.43  % iterative deepening steps: 771
% 0.19/0.43  % maximum path limit: 5
% 0.19/0.43  % literal attempts: 29497
% 0.19/0.43  % depth failures: 11685
% 0.19/0.43  % regularity failures: 3194
% 0.19/0.43  % tautology failures: 1518
% 0.19/0.43  % reductions: 0
% 0.19/0.43  % extensions: 28739
% 0.19/0.43  % SAT variables: 10669
% 0.19/0.43  % SAT clauses: 15077
% 0.19/0.43  % WalkSAT solutions: 15072
% 0.19/0.43  % CDCL solutions: 0
% 0.19/0.43  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.43  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------