TSTP Solution File: PUZ035-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PUZ035-1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 May 21 02:24:47 EDT 2024
% Result : Unsatisfiable 0.23s 0.50s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 6 unt; 7 nHn; 17 RR)
% Number of literals : 34 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 15 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(everyone_a_knight_or_knave,axiom,
( isa(X1,knight)
| isa(X1,knave)
| ~ person(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',everyone_a_knight_or_knave) ).
cnf(prove_answer,negated_conjecture,
( ~ response(X1)
| ~ isa(asked,X2)
| ~ isa(other,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_answer) ).
cnf(asked_person,axiom,
person(asked),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',asked_person) ).
cnf(other_person,axiom,
person(other),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',other_person) ).
cnf(two_answers,axiom,
( response(yes)
| response(no) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',two_answers) ).
cnf(c_0_5,plain,
( isa(X1,knight)
| isa(X1,knave)
| ~ person(X1) ),
inference(fof_simplification,[status(thm)],[everyone_a_knight_or_knave]) ).
cnf(c_0_6,negated_conjecture,
( ~ response(X1)
| ~ isa(asked,X2)
| ~ isa(other,X3) ),
inference(fof_simplification,[status(thm)],[prove_answer]) ).
cnf(c_0_7,plain,
( isa(X1,knight)
| isa(X1,knave)
| ~ person(X1) ),
c_0_5 ).
cnf(c_0_8,axiom,
person(asked),
asked_person ).
cnf(c_0_9,negated_conjecture,
( ~ response(X1)
| ~ isa(asked,X2)
| ~ isa(other,X3) ),
c_0_6 ).
cnf(c_0_10,plain,
( isa(asked,knave)
| isa(asked,knight) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
person(other),
other_person ).
cnf(c_0_12,negated_conjecture,
( ~ response(X1)
| ~ isa(other,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_9]) ).
cnf(c_0_13,plain,
( isa(other,knave)
| isa(other,knight) ),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,axiom,
( response(yes)
| response(no) ),
two_answers ).
cnf(c_0_15,negated_conjecture,
~ response(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_12]) ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_14,c_0_15]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PUZ035-1 : TPTP v8.2.0. Released v2.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n028.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Sat May 18 10:37:23 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.23/0.49 Running first-order theorem proving
% 0.23/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.50 # Version: 3.1.0
% 0.23/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.50 # Starting sh5l with 300s (1) cores
% 0.23/0.50 # sh5l with pid 24501 completed with status 0
% 0.23/0.50 # Result found by sh5l
% 0.23/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.50 # Starting sh5l with 300s (1) cores
% 0.23/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.50 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.23/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.50 # SAT001_MinMin_p005000_rr_RG with pid 24508 completed with status 0
% 0.23/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.50 # Starting sh5l with 300s (1) cores
% 0.23/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.50 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.23/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.50 # Preprocessing time : 0.001 s
% 0.23/0.50 # Presaturation interreduction done
% 0.23/0.50
% 0.23/0.50 # Proof found!
% 0.23/0.50 # SZS status Unsatisfiable
% 0.23/0.50 # SZS output start CNFRefutation
% See solution above
% 0.23/0.50 # Parsed axioms : 15
% 0.23/0.50 # Removed by relevancy pruning/SinE : 0
% 0.23/0.50 # Initial clauses : 15
% 0.23/0.50 # Removed in clause preprocessing : 0
% 0.23/0.50 # Initial clauses in saturation : 15
% 0.23/0.50 # Processed clauses : 38
% 0.23/0.50 # ...of these trivial : 0
% 0.23/0.50 # ...subsumed : 1
% 0.23/0.50 # ...remaining for further processing : 37
% 0.23/0.50 # Other redundant clauses eliminated : 0
% 0.23/0.50 # Clauses deleted for lack of memory : 0
% 0.23/0.50 # Backward-subsumed : 8
% 0.23/0.50 # Backward-rewritten : 0
% 0.23/0.50 # Generated clauses : 15
% 0.23/0.50 # ...of the previous two non-redundant : 11
% 0.23/0.50 # ...aggressively subsumed : 0
% 0.23/0.50 # Contextual simplify-reflections : 2
% 0.23/0.50 # Paramodulations : 14
% 0.23/0.50 # Factorizations : 0
% 0.23/0.50 # NegExts : 0
% 0.23/0.50 # Equation resolutions : 0
% 0.23/0.50 # Disequality decompositions : 0
% 0.23/0.50 # Total rewrite steps : 0
% 0.23/0.50 # ...of those cached : 0
% 0.23/0.50 # Propositional unsat checks : 0
% 0.23/0.50 # Propositional check models : 0
% 0.23/0.50 # Propositional check unsatisfiable : 0
% 0.23/0.50 # Propositional clauses : 0
% 0.23/0.50 # Propositional clauses after purity: 0
% 0.23/0.50 # Propositional unsat core size : 0
% 0.23/0.50 # Propositional preprocessing time : 0.000
% 0.23/0.50 # Propositional encoding time : 0.000
% 0.23/0.50 # Propositional solver time : 0.000
% 0.23/0.50 # Success case prop preproc time : 0.000
% 0.23/0.50 # Success case prop encoding time : 0.000
% 0.23/0.50 # Success case prop solver time : 0.000
% 0.23/0.50 # Current number of processed clauses : 13
% 0.23/0.50 # Positive orientable unit clauses : 2
% 0.23/0.50 # Positive unorientable unit clauses: 0
% 0.23/0.50 # Negative unit clauses : 1
% 0.23/0.50 # Non-unit-clauses : 10
% 0.23/0.50 # Current number of unprocessed clauses: 3
% 0.23/0.50 # ...number of literals in the above : 11
% 0.23/0.50 # Current number of archived formulas : 0
% 0.23/0.50 # Current number of archived clauses : 24
% 0.23/0.50 # Clause-clause subsumption calls (NU) : 136
% 0.23/0.50 # Rec. Clause-clause subsumption calls : 85
% 0.23/0.50 # Non-unit clause-clause subsumptions : 4
% 0.23/0.50 # Unit Clause-clause subsumption calls : 7
% 0.23/0.50 # Rewrite failures with RHS unbound : 0
% 0.23/0.50 # BW rewrite match attempts : 0
% 0.23/0.50 # BW rewrite match successes : 0
% 0.23/0.50 # Condensation attempts : 0
% 0.23/0.50 # Condensation successes : 0
% 0.23/0.50 # Termbank termtop insertions : 717
% 0.23/0.50 # Search garbage collected termcells : 36
% 0.23/0.50
% 0.23/0.50 # -------------------------------------------------
% 0.23/0.50 # User time : 0.003 s
% 0.23/0.50 # System time : 0.002 s
% 0.23/0.50 # Total time : 0.005 s
% 0.23/0.50 # Maximum resident set size: 1600 pages
% 0.23/0.50
% 0.23/0.50 # -------------------------------------------------
% 0.23/0.50 # User time : 0.004 s
% 0.23/0.50 # System time : 0.003 s
% 0.23/0.50 # Total time : 0.008 s
% 0.23/0.50 # Maximum resident set size: 1696 pages
% 0.23/0.50 % E---3.1 exiting
% 0.23/0.50 % E exiting
%------------------------------------------------------------------------------