↑ Up

Enigma---0.5.1.CSA-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : PUZ153+1 : TPTP v9.1.0. Released v9.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n028.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 : Tue Apr  1 01:59:42 AM UTC 2025

% Result   : CounterSatisfiable 7.55s 2.30s
% Output   : Saturation 7.55s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
    ( created_equal(X1,X2)
    | ~ human(X2)
    | ~ human(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zd85kc3k/input.p',i_0_1) ).

cnf(i_0_2,plain,
    human(john),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zd85kc3k/input.p',i_0_2) ).

cnf(i_0_5,plain,
    human(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zd85kc3k/input.p',i_0_5) ).

cnf(i_0_10,negated_conjecture,
    ( esk2_0 = esk3_0
    | human(esk2_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zd85kc3k/input.p',i_0_10) ).

cnf(i_0_9,negated_conjecture,
    ( esk2_0 = esk3_0
    | human(esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zd85kc3k/input.p',i_0_9) ).

cnf(i_0_7,plain,
    ~ human(grade_of(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zd85kc3k/input.p',i_0_7) ).

cnf(i_0_4,plain,
    grade_of(esk1_0) = a,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zd85kc3k/input.p',i_0_4) ).

cnf(i_0_3,plain,
    grade_of(john) = f,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zd85kc3k/input.p',i_0_3) ).

cnf(i_0_11,negated_conjecture,
    ( esk2_0 != esk3_0
    | ~ human(esk2_0)
    | ~ human(esk3_0)
    | ~ created_equal(esk2_0,esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zd85kc3k/input.p',i_0_11) ).

cnf(i_0_8,negated_conjecture,
    ( esk2_0 = esk3_0
    | created_equal(esk2_0,esk3_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zd85kc3k/input.p',i_0_8) ).

cnf(i_0_6,plain,
    a != f,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zd85kc3k/input.p',i_0_6) ).

cnf(c_0_23,plain,
    ( created_equal(X1,X2)
    | ~ human(X2)
    | ~ human(X1) ),
    i_0_1,
    [final] ).

cnf(c_0_24,plain,
    human(john),
    i_0_2,
    [final] ).

cnf(c_0_25,plain,
    human(esk1_0),
    i_0_5,
    [final] ).

cnf(c_0_26,negated_conjecture,
    ( esk2_0 = esk3_0
    | human(esk2_0) ),
    i_0_10,
    [final] ).

cnf(c_0_27,negated_conjecture,
    ( esk2_0 = esk3_0
    | human(esk3_0) ),
    i_0_9,
    [final] ).

cnf(c_0_28,plain,
    ~ human(grade_of(X1)),
    i_0_7,
    [final] ).

cnf(c_0_29,plain,
    grade_of(esk1_0) = a,
    i_0_4,
    [final] ).

cnf(c_0_30,plain,
    grade_of(john) = f,
    i_0_3,
    [final] ).

cnf(c_0_31,plain,
    ( created_equal(X1,john)
    | ~ human(X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]),
    [final] ).

cnf(c_0_32,plain,
    ( created_equal(X1,esk1_0)
    | ~ human(X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_25]),
    [final] ).

cnf(c_0_33,negated_conjecture,
    ( esk2_0 = esk3_0
    | created_equal(X1,esk2_0)
    | ~ human(X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_26]),
    [final] ).

cnf(c_0_34,negated_conjecture,
    ( esk2_0 = esk3_0
    | created_equal(X1,esk3_0)
    | ~ human(X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_27]),
    [final] ).

cnf(c_0_35,negated_conjecture,
    ( esk2_0 != esk3_0
    | ~ human(esk2_0)
    | ~ human(esk3_0)
    | ~ created_equal(esk2_0,esk3_0) ),
    i_0_11,
    [final] ).

cnf(c_0_36,negated_conjecture,
    ( esk2_0 = esk3_0
    | created_equal(esk2_0,esk3_0) ),
    i_0_8,
    [final] ).

cnf(c_0_37,plain,
    ~ human(a),
    inference(spm,[status(thm)],[c_0_28,c_0_29]),
    [final] ).

cnf(c_0_38,plain,
    ~ human(f),
    inference(spm,[status(thm)],[c_0_28,c_0_30]),
    [final] ).

cnf(c_0_39,plain,
    a != f,
    i_0_6,
    [final] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14  % Problem  : PUZ153+1 : TPTP v9.1.0. Released v9.1.0.
% 0.11/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.36  % Computer : n028.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit : 300
% 0.13/0.36  % WCLimit  : 300
% 0.13/0.36  % DateTime : Mon Mar 31 10:58:37 EDT 2025
% 0.13/0.36  % CPUTime  : 
% 0.19/0.48  # ENIGMATIC: Selected complete mode:
% 7.55/2.30  # ENIGMATIC: Solved by autoschedule:
% 7.55/2.30  # No SInE strategy applied
% 7.55/2.30  # Trying AutoSched0 for 150 seconds
% 7.55/2.30  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S021N
% 7.55/2.30  # and selection function PSelectAllCondOptimalLit.
% 7.55/2.30  #
% 7.55/2.30  # Preprocessing time       : 0.024 s
% 7.55/2.30  # Presaturation interreduction done
% 7.55/2.30  
% 7.55/2.30  # No proof found!
% 7.55/2.30  # SZS status Satisfiable
% 7.55/2.30  # SZS output start Saturation
% See solution above
% 7.55/2.30  
% 7.55/2.30  # -------------------------------------------------
% 7.55/2.30  # User time                : 0.026 s
% 7.55/2.30  # System time              : 0.004 s
% 7.55/2.30  # Total time               : 0.030 s
% 7.55/2.30  # Maximum resident set size: 7124 pages
% 7.55/2.30  
%------------------------------------------------------------------------------