TSTP Solution File: PUZ131-10 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : PUZ131-10 : TPTP v8.2.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n022.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 May 21 02:26:23 EDT 2024

% Result   : Unsatisfiable 0.19s 0.48s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   22 (  22 unt;   0 nHn;  15 RR)
%            Number of literals    :   22 (  21 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   4 con; 0-4 aty)
%            Number of variables   :   15 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(student_enrolled_taught,axiom,
    ifeq(teaches(X1,X2),true,ifeq(enrolled(X3,X2),true,ifeq(course(X2),true,ifeq(professor(X1),true,ifeq(student(X3),true,taughtby(X3,X1),true),true),true),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',student_enrolled_taught) ).

cnf(michael_enrolled_csc410_axiom,axiom,
    enrolled(michael,csc410) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',michael_enrolled_csc410_axiom) ).

cnf(csc410_type,axiom,
    course(csc410) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',csc410_type) ).

cnf(michael_type,axiom,
    student(michael) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',michael_type) ).

cnf(ifeq_axiom,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).

cnf(coordinator_teaches,axiom,
    ifeq(course(X1),true,teaches(coordinatorof(X1),X1),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',coordinator_teaches) ).

cnf(victor_coordinator_csc410_axiom,axiom,
    coordinatorof(csc410) = victor,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',victor_coordinator_csc410_axiom) ).

cnf(teaching_conjecture,negated_conjecture,
    taughtby(michael,victor) != true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',teaching_conjecture) ).

cnf(victor_type,axiom,
    professor(victor) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',victor_type) ).

cnf(c_0_9,axiom,
    ifeq(teaches(X1,X2),true,ifeq(enrolled(X3,X2),true,ifeq(course(X2),true,ifeq(professor(X1),true,ifeq(student(X3),true,taughtby(X3,X1),true),true),true),true),true) = true,
    student_enrolled_taught ).

cnf(c_0_10,axiom,
    enrolled(michael,csc410) = true,
    michael_enrolled_csc410_axiom ).

cnf(c_0_11,axiom,
    course(csc410) = true,
    csc410_type ).

cnf(c_0_12,axiom,
    student(michael) = true,
    michael_type ).

cnf(c_0_13,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    ifeq_axiom ).

cnf(c_0_14,axiom,
    ifeq(course(X1),true,teaches(coordinatorof(X1),X1),true) = true,
    coordinator_teaches ).

cnf(c_0_15,axiom,
    coordinatorof(csc410) = victor,
    victor_coordinator_csc410_axiom ).

cnf(c_0_16,negated_conjecture,
    taughtby(michael,victor) != true,
    inference(fof_simplification,[status(thm)],[teaching_conjecture]) ).

cnf(c_0_17,plain,
    ifeq(teaches(X1,csc410),true,ifeq(professor(X1),true,taughtby(michael,X1),true),true) = true,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13]),c_0_13]),c_0_13]) ).

cnf(c_0_18,axiom,
    professor(victor) = true,
    victor_type ).

cnf(c_0_19,plain,
    teaches(victor,csc410) = true,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_11]),c_0_13]) ).

cnf(c_0_20,negated_conjecture,
    taughtby(michael,victor) != true,
    c_0_16 ).

cnf(c_0_21,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_13]),c_0_13]),c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : PUZ131-10 : TPTP v8.2.0. Released v7.5.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n022.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    : 300
% 0.13/0.34  % DateTime   : Sat May 18 10:56:22 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.19/0.47  Running first-order model finding
% 0.19/0.47  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48  # Version: 3.1.0
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48  # Starting sh5l with 300s (1) cores
% 0.19/0.48  # new_bool_1 with pid 24161 completed with status 0
% 0.19/0.48  # Result found by new_bool_1
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48  # Search class: FUUPM-FFSS31-DFFFFFNN
% 0.19/0.48  # partial match(1): FUUPM-FFSF31-DFFFFFNN
% 0.19/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 75s (1) cores
% 0.19/0.48  # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 24167 completed with status 0
% 0.19/0.48  # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48  # Search class: FUUPM-FFSS31-DFFFFFNN
% 0.19/0.48  # partial match(1): FUUPM-FFSF31-DFFFFFNN
% 0.19/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 75s (1) cores
% 0.19/0.48  # Preprocessing time       : 0.001 s
% 0.19/0.48  # Presaturation interreduction done
% 0.19/0.48  
% 0.19/0.48  # Proof found!
% 0.19/0.48  # SZS status Unsatisfiable
% 0.19/0.48  # SZS output start CNFRefutation
% See solution above
% 0.19/0.48  # Parsed axioms                        : 21
% 0.19/0.48  # Removed by relevancy pruning/SinE    : 11
% 0.19/0.48  # Initial clauses                      : 10
% 0.19/0.48  # Removed in clause preprocessing      : 0
% 0.19/0.48  # Initial clauses in saturation        : 10
% 0.19/0.48  # Processed clauses                    : 23
% 0.19/0.48  # ...of these trivial                  : 1
% 0.19/0.48  # ...subsumed                          : 0
% 0.19/0.48  # ...remaining for further processing  : 22
% 0.19/0.48  # Other redundant clauses eliminated   : 0
% 0.19/0.48  # Clauses deleted for lack of memory   : 0
% 0.19/0.48  # Backward-subsumed                    : 0
% 0.19/0.48  # Backward-rewritten                   : 0
% 0.19/0.48  # Generated clauses                    : 11
% 0.19/0.48  # ...of the previous two non-redundant : 7
% 0.19/0.48  # ...aggressively subsumed             : 0
% 0.19/0.48  # Contextual simplify-reflections      : 0
% 0.19/0.48  # Paramodulations                      : 11
% 0.19/0.48  # Factorizations                       : 0
% 0.19/0.48  # NegExts                              : 0
% 0.19/0.48  # Equation resolutions                 : 0
% 0.19/0.48  # Disequality decompositions           : 0
% 0.19/0.48  # Total rewrite steps                  : 27
% 0.19/0.48  # ...of those cached                   : 13
% 0.19/0.48  # Propositional unsat checks           : 0
% 0.19/0.48  #    Propositional check models        : 0
% 0.19/0.48  #    Propositional check unsatisfiable : 0
% 0.19/0.48  #    Propositional clauses             : 0
% 0.19/0.48  #    Propositional clauses after purity: 0
% 0.19/0.48  #    Propositional unsat core size     : 0
% 0.19/0.48  #    Propositional preprocessing time  : 0.000
% 0.19/0.48  #    Propositional encoding time       : 0.000
% 0.19/0.48  #    Propositional solver time         : 0.000
% 0.19/0.48  #    Success case prop preproc time    : 0.000
% 0.19/0.48  #    Success case prop encoding time   : 0.000
% 0.19/0.48  #    Success case prop solver time     : 0.000
% 0.19/0.48  # Current number of processed clauses  : 12
% 0.19/0.48  #    Positive orientable unit clauses  : 11
% 0.19/0.48  #    Positive unorientable unit clauses: 0
% 0.19/0.48  #    Negative unit clauses             : 1
% 0.19/0.48  #    Non-unit-clauses                  : 0
% 0.19/0.48  # Current number of unprocessed clauses: 4
% 0.19/0.48  # ...number of literals in the above   : 4
% 0.19/0.48  # Current number of archived formulas  : 0
% 0.19/0.48  # Current number of archived clauses   : 10
% 0.19/0.48  # Clause-clause subsumption calls (NU) : 0
% 0.19/0.48  # Rec. Clause-clause subsumption calls : 0
% 0.19/0.48  # Non-unit clause-clause subsumptions  : 0
% 0.19/0.48  # Unit Clause-clause subsumption calls : 0
% 0.19/0.48  # Rewrite failures with RHS unbound    : 0
% 0.19/0.48  # BW rewrite match attempts            : 2
% 0.19/0.48  # BW rewrite match successes           : 0
% 0.19/0.48  # Condensation attempts                : 0
% 0.19/0.48  # Condensation successes               : 0
% 0.19/0.48  # Termbank termtop insertions          : 566
% 0.19/0.48  # Search garbage collected termcells   : 40
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.001 s
% 0.19/0.48  # System time              : 0.003 s
% 0.19/0.48  # Total time               : 0.004 s
% 0.19/0.48  # Maximum resident set size: 1624 pages
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.003 s
% 0.19/0.48  # System time              : 0.004 s
% 0.19/0.48  # Total time               : 0.008 s
% 0.19/0.48  # Maximum resident set size: 1700 pages
% 0.19/0.48  % E---3.1 exiting
%------------------------------------------------------------------------------