TSTP Solution File: PUZ008-3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 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 : 600s
% DateTime : Mon Jul 18 18:10:56 EDT 2022
% Result : Unsatisfiable 0.19s 0.40s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun May 29 01:08:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 16 Number of unprocessed: 16
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.38 # The folding up rule is enabled...
% 0.12/0.38 # Local unification is enabled...
% 0.12/0.38 # Any saturation attempts will use folding labels...
% 0.12/0.38 # 16 beginning clauses after preprocessing and clausification
% 0.12/0.38 # Creating start rules for all 1 conjectures.
% 0.12/0.38 # There are 1 start rule candidates:
% 0.12/0.38 # Found 4 unit axioms.
% 0.12/0.38 # 1 start rule tableaux created.
% 0.12/0.38 # 12 extension rule candidate clauses
% 0.12/0.38 # 4 unit axiom clauses
% 0.12/0.38
% 0.12/0.38 # Requested 8, 32 cores available to the main process.
% 0.12/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.40 # There were 4 total branch saturation attempts.
% 0.19/0.40 # There were 0 of these attempts blocked.
% 0.19/0.40 # There were 0 deferred branch saturation attempts.
% 0.19/0.40 # There were 0 free duplicated saturations.
% 0.19/0.40 # There were 4 total successful branch saturations.
% 0.19/0.40 # There were 0 successful branch saturations in interreduction.
% 0.19/0.40 # There were 0 successful branch saturations on the branch.
% 0.19/0.40 # There were 4 successful branch saturations after the branch.
% 0.19/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.40 # Begin clausification derivation
% 0.19/0.40
% 0.19/0.40 # End clausification derivation
% 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.40 cnf(i_0_19, plain, (greater_or_equal(X1,n0))).
% 0.19/0.40 cnf(i_0_17, plain, (safe(n0,X1))).
% 0.19/0.40 cnf(i_0_31, hypothesis, (achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))))).
% 0.19/0.40 cnf(i_0_32, negated_conjecture, (~achievable(west(m(n0),c(n0)),X1,east(m(s(s(s(n0)))),c(s(s(s(n0)))))))).
% 0.19/0.40 cnf(i_0_18, plain, (safe(X1,X2)|~greater_or_equal(X1,X2))).
% 0.19/0.40 cnf(i_0_20, plain, (greater_or_equal(s(X1),s(X2))|~greater_or_equal(X1,X2))).
% 0.19/0.40 cnf(i_0_21, plain, (achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))|~achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4)))|~safe(X3,s(X4))|~safe(X1,X2))).
% 0.19/0.40 cnf(i_0_25, plain, (achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))|~achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4)))|~safe(s(X3),X4)|~safe(X1,X2))).
% 0.19/0.40 cnf(i_0_29, plain, (achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))|~achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))|~safe(s(X3),s(X4))|~safe(X1,X2))).
% 0.19/0.40 cnf(i_0_23, plain, (achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4)))))|~achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))|~safe(X3,s(s(X4)))|~safe(X1,X2))).
% 0.19/0.40 cnf(i_0_27, plain, (achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4)))|~achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))|~safe(s(s(X3)),X4)|~safe(X1,X2))).
% 0.19/0.40 cnf(i_0_22, plain, (achievable(west(m(X1),c(s(X2))),boatonwest,east(m(X3),c(X4)))|~achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(X4))))|~safe(X1,s(X2))|~safe(X3,X4))).
% 0.19/0.40 cnf(i_0_26, plain, (achievable(west(m(s(X1)),c(X2)),boatonwest,east(m(X3),c(X4)))|~achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(X4)))|~safe(s(X1),X2)|~safe(X3,X4))).
% 0.19/0.40 cnf(i_0_30, plain, (achievable(west(m(s(X1)),c(s(X2))),boatonwest,east(m(X3),c(X4)))|~achievable(west(m(X1),c(X2)),boatoneast,east(m(s(X3)),c(s(X4))))|~safe(s(X1),s(X2))|~safe(X3,X4))).
% 0.19/0.40 cnf(i_0_24, plain, (achievable(west(m(X1),c(s(s(X2)))),boatonwest,east(m(X3),c(X4)))|~achievable(west(m(X1),c(X2)),boatoneast,east(m(X3),c(s(s(X4)))))|~safe(X1,s(s(X2)))|~safe(X3,X4))).
% 0.19/0.40 cnf(i_0_28, plain, (achievable(west(m(s(s(X1))),c(X2)),boatonwest,east(m(X3),c(X4)))|~achievable(west(m(X1),c(X2)),boatoneast,east(m(s(s(X3))),c(X4)))|~safe(s(s(X1)),X2)|~safe(X3,X4))).
% 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.40 # Begin printing tableau
% 0.19/0.40 # Found 8 steps
% 0.19/0.40 cnf(i_0_32, negated_conjecture, (~achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0))))))), inference(start_rule)).
% 0.19/0.40 cnf(i_0_33, plain, (~achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0))))))), inference(extension_rule, [i_0_27])).
% 0.19/0.40 cnf(i_0_57, plain, (~safe(n0,n0)), inference(closure_rule, [i_0_17])).
% 0.19/0.40 cnf(i_0_55, plain, (~achievable(west(m(s(s(n0))),c(n0)),boatonwest,east(m(s(n0)),c(s(s(s(n0))))))), inference(extension_rule, [i_0_26])).
% 0.19/0.40 cnf(i_0_56, plain, (~safe(s(s(s(n0))),s(s(s(n0))))), inference(etableau_closure_rule, [i_0_56, ...])).
% 0.19/0.40 cnf(i_0_107, plain, (~achievable(west(m(s(n0)),c(n0)),boatoneast,east(m(s(s(n0))),c(s(s(s(n0))))))), inference(etableau_closure_rule, [i_0_107, ...])).
% 0.19/0.40 cnf(i_0_108, plain, (~safe(s(s(n0)),n0)), inference(etableau_closure_rule, [i_0_108, ...])).
% 0.19/0.40 cnf(i_0_109, plain, (~safe(s(n0),s(s(s(n0))))), inference(etableau_closure_rule, [i_0_109, ...])).
% 0.19/0.40 # End printing tableau
% 0.19/0.40 # SZS output end
% 0.19/0.40 # Branches closed with saturation will be marked with an "s"
% 0.19/0.40 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.40 # We now have 5 tableaux to operate on
% 0.19/0.40 # Found closed tableau during pool population.
% 0.19/0.40 # Proof search is over...
% 0.19/0.40 # Freeing feature tree
%------------------------------------------------------------------------------