TSTP Solution File: PLA017-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : PLA017-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n005.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:10:21 EDT 2023

% Result   : Unsatisfiable 0.20s 0.48s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   25 (  14 unt;   0 nHn;  25 RR)
%            Number of literals    :   46 (   0 equ;  26 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :   25 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_AC,negated_conjecture,
    ~ holds(on(a,c),X1),
    file('/export/starexec/sandbox/tmp/tmp.TSTBfAlO4E/E---3.1_27524.p',prove_AC) ).

cnf(putdown_2,axiom,
    ( holds(on(X1,X2),do(putdown(X1,X2),X3))
    | ~ holds(holding(X1),X3)
    | ~ holds(clear(X2),X3) ),
    file('/export/starexec/sandbox/tmp/tmp.TSTBfAlO4E/E---3.1_27524.p',putdown_2) ).

cnf(pickup_1,axiom,
    ( holds(holding(X1),do(pickup(X1),X2))
    | ~ holds(empty,X2)
    | ~ holds(clear(X1),X2)
    | ~ differ(X1,table) ),
    file('/export/starexec/sandbox/tmp/tmp.TSTBfAlO4E/E---3.1_27524.p',pickup_1) ).

cnf(differ_a_table,axiom,
    differ(a,table),
    file('/export/starexec/sandbox/tmp/tmp.TSTBfAlO4E/E---3.1_27524.p',differ_a_table) ).

cnf(symmetry_of_differ,axiom,
    ( differ(X1,X2)
    | ~ differ(X2,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.TSTBfAlO4E/E---3.1_27524.p',symmetry_of_differ) ).

cnf(differ_a_c,axiom,
    differ(a,c),
    file('/export/starexec/sandbox/tmp/tmp.TSTBfAlO4E/E---3.1_27524.p',differ_a_c) ).

cnf(pickup_4,axiom,
    ( holds(clear(X1),do(pickup(X2),X3))
    | ~ holds(clear(X1),X3)
    | ~ differ(X1,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.TSTBfAlO4E/E---3.1_27524.p',pickup_4) ).

cnf(initial_state7,axiom,
    holds(clear(c),s0),
    file('/export/starexec/sandbox/tmp/tmp.TSTBfAlO4E/E---3.1_27524.p',initial_state7) ).

cnf(initial_state5,axiom,
    holds(clear(a),s0),
    file('/export/starexec/sandbox/tmp/tmp.TSTBfAlO4E/E---3.1_27524.p',initial_state5) ).

cnf(initial_state8,axiom,
    holds(empty,s0),
    file('/export/starexec/sandbox/tmp/tmp.TSTBfAlO4E/E---3.1_27524.p',initial_state8) ).

cnf(c_0_10,negated_conjecture,
    ~ holds(on(a,c),X1),
    prove_AC ).

cnf(c_0_11,axiom,
    ( holds(on(X1,X2),do(putdown(X1,X2),X3))
    | ~ holds(holding(X1),X3)
    | ~ holds(clear(X2),X3) ),
    putdown_2 ).

cnf(c_0_12,negated_conjecture,
    ( ~ holds(holding(a),X1)
    | ~ holds(clear(c),X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,axiom,
    ( holds(holding(X1),do(pickup(X1),X2))
    | ~ holds(empty,X2)
    | ~ holds(clear(X1),X2)
    | ~ differ(X1,table) ),
    pickup_1 ).

cnf(c_0_14,axiom,
    differ(a,table),
    differ_a_table ).

cnf(c_0_15,axiom,
    ( differ(X1,X2)
    | ~ differ(X2,X1) ),
    symmetry_of_differ ).

cnf(c_0_16,axiom,
    differ(a,c),
    differ_a_c ).

cnf(c_0_17,negated_conjecture,
    ( ~ holds(clear(c),do(pickup(a),X1))
    | ~ holds(clear(a),X1)
    | ~ holds(empty,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).

cnf(c_0_18,axiom,
    ( holds(clear(X1),do(pickup(X2),X3))
    | ~ holds(clear(X1),X3)
    | ~ differ(X1,X2) ),
    pickup_4 ).

cnf(c_0_19,plain,
    differ(c,a),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ holds(clear(a),X1)
    | ~ holds(clear(c),X1)
    | ~ holds(empty,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).

cnf(c_0_21,axiom,
    holds(clear(c),s0),
    initial_state7 ).

cnf(c_0_22,axiom,
    holds(clear(a),s0),
    initial_state5 ).

cnf(c_0_23,axiom,
    holds(empty,s0),
    initial_state8 ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : PLA017-1 : TPTP v8.1.2. Released v1.1.0.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n005.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   : 2400
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Oct  2 20:17:01 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.20/0.47  Running first-order model finding
% 0.20/0.47  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.TSTBfAlO4E/E---3.1_27524.p
% 0.20/0.48  # Version: 3.1pre001
% 0.20/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48  # Starting sh5l with 300s (1) cores
% 0.20/0.48  # sh5l with pid 27604 completed with status 0
% 0.20/0.48  # Result found by sh5l
% 0.20/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48  # Starting sh5l with 300s (1) cores
% 0.20/0.48  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.48  # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.20/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48  # SAT001_MinMin_p005000_rr_RG with pid 27611 completed with status 0
% 0.20/0.48  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48  # Starting sh5l with 300s (1) cores
% 0.20/0.48  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.48  # Search class: FHUNF-FFMM21-SFFFFFNN
% 0.20/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48  # Preprocessing time       : 0.001 s
% 0.20/0.48  # Presaturation interreduction done
% 0.20/0.48  
% 0.20/0.48  # Proof found!
% 0.20/0.48  # SZS status Unsatisfiable
% 0.20/0.48  # SZS output start CNFRefutation
% See solution above
% 0.20/0.48  # Parsed axioms                        : 31
% 0.20/0.48  # Removed by relevancy pruning/SinE    : 1
% 0.20/0.48  # Initial clauses                      : 30
% 0.20/0.48  # Removed in clause preprocessing      : 0
% 0.20/0.48  # Initial clauses in saturation        : 30
% 0.20/0.48  # Processed clauses                    : 75
% 0.20/0.48  # ...of these trivial                  : 0
% 0.20/0.48  # ...subsumed                          : 2
% 0.20/0.48  # ...remaining for further processing  : 73
% 0.20/0.48  # Other redundant clauses eliminated   : 0
% 0.20/0.48  # Clauses deleted for lack of memory   : 0
% 0.20/0.48  # Backward-subsumed                    : 0
% 0.20/0.48  # Backward-rewritten                   : 0
% 0.20/0.48  # Generated clauses                    : 31
% 0.20/0.48  # ...of the previous two non-redundant : 16
% 0.20/0.48  # ...aggressively subsumed             : 0
% 0.20/0.48  # Contextual simplify-reflections      : 0
% 0.20/0.48  # Paramodulations                      : 31
% 0.20/0.48  # Factorizations                       : 0
% 0.20/0.48  # NegExts                              : 0
% 0.20/0.48  # Equation resolutions                 : 0
% 0.20/0.48  # Total rewrite steps                  : 14
% 0.20/0.48  # Propositional unsat checks           : 0
% 0.20/0.48  #    Propositional check models        : 0
% 0.20/0.48  #    Propositional check unsatisfiable : 0
% 0.20/0.48  #    Propositional clauses             : 0
% 0.20/0.48  #    Propositional clauses after purity: 0
% 0.20/0.48  #    Propositional unsat core size     : 0
% 0.20/0.48  #    Propositional preprocessing time  : 0.000
% 0.20/0.48  #    Propositional encoding time       : 0.000
% 0.20/0.48  #    Propositional solver time         : 0.000
% 0.20/0.48  #    Success case prop preproc time    : 0.000
% 0.20/0.48  #    Success case prop encoding time   : 0.000
% 0.20/0.48  #    Success case prop solver time     : 0.000
% 0.20/0.48  # Current number of processed clauses  : 43
% 0.20/0.48  #    Positive orientable unit clauses  : 29
% 0.20/0.48  #    Positive unorientable unit clauses: 0
% 0.20/0.48  #    Negative unit clauses             : 1
% 0.20/0.48  #    Non-unit-clauses                  : 13
% 0.20/0.48  # Current number of unprocessed clauses: 1
% 0.20/0.48  # ...number of literals in the above   : 3
% 0.20/0.48  # Current number of archived formulas  : 0
% 0.20/0.48  # Current number of archived clauses   : 30
% 0.20/0.48  # Clause-clause subsumption calls (NU) : 47
% 0.20/0.48  # Rec. Clause-clause subsumption calls : 38
% 0.20/0.48  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.48  # Unit Clause-clause subsumption calls : 0
% 0.20/0.48  # Rewrite failures with RHS unbound    : 0
% 0.20/0.48  # BW rewrite match attempts            : 0
% 0.20/0.48  # BW rewrite match successes           : 0
% 0.20/0.48  # Condensation attempts                : 0
% 0.20/0.48  # Condensation successes               : 0
% 0.20/0.48  # Termbank termtop insertions          : 1103
% 0.20/0.48  
% 0.20/0.48  # -------------------------------------------------
% 0.20/0.48  # User time                : 0.005 s
% 0.20/0.48  # System time              : 0.001 s
% 0.20/0.48  # Total time               : 0.006 s
% 0.20/0.48  # Maximum resident set size: 1620 pages
% 0.20/0.48  
% 0.20/0.48  # -------------------------------------------------
% 0.20/0.48  # User time                : 0.007 s
% 0.20/0.48  # System time              : 0.002 s
% 0.20/0.48  # Total time               : 0.010 s
% 0.20/0.48  # Maximum resident set size: 1696 pages
% 0.20/0.48  % E---3.1 exiting
%------------------------------------------------------------------------------