TSTP Solution File: PLA002-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PLA002-2 : TPTP v8.1.0. Released v1.0.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 : n032.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 16:56:37 EDT 2022
% Result : Unsatisfiable 0.14s 0.35s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : PLA002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Tue May 31 19:34:28 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.09/0.30 # No SInE strategy applied
% 0.09/0.30 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.09/0.30 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.09/0.30 #
% 0.09/0.30 # Presaturation interreduction done
% 0.09/0.30 # Number of axioms: 23 Number of unprocessed: 21
% 0.09/0.30 # Tableaux proof search.
% 0.09/0.30 # APR header successfully linked.
% 0.09/0.30 # Hello from C++
% 0.09/0.30 # The folding up rule is enabled...
% 0.09/0.30 # Local unification is enabled...
% 0.09/0.30 # Any saturation attempts will use folding labels...
% 0.09/0.30 # 21 beginning clauses after preprocessing and clausification
% 0.09/0.30 # Creating start rules for all 1 conjectures.
% 0.09/0.30 # There are 1 start rule candidates:
% 0.09/0.30 # Found 2 unit axioms.
% 0.09/0.30 # 1 start rule tableaux created.
% 0.09/0.30 # 19 extension rule candidate clauses
% 0.09/0.30 # 2 unit axiom clauses
% 0.09/0.30
% 0.09/0.30 # Requested 8, 32 cores available to the main process.
% 0.09/0.30 # There are not enough tableaux to fork, creating more from the initial 1
% 0.09/0.30 # Ran out of tableaux, making start rules for all clauses
% 0.09/0.30 # Returning from population with 40 new_tableaux and 0 remaining starting tableaux.
% 0.09/0.30 # We now have 40 tableaux to operate on
% 0.14/0.35 # There were 4 total branch saturation attempts.
% 0.14/0.35 # There were 0 of these attempts blocked.
% 0.14/0.35 # There were 0 deferred branch saturation attempts.
% 0.14/0.35 # There were 0 free duplicated saturations.
% 0.14/0.35 # There were 4 total successful branch saturations.
% 0.14/0.35 # There were 0 successful branch saturations in interreduction.
% 0.14/0.35 # There were 0 successful branch saturations on the branch.
% 0.14/0.35 # There were 4 successful branch saturations after the branch.
% 0.14/0.35 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.35 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.35 # Begin clausification derivation
% 0.14/0.35
% 0.14/0.35 # End clausification derivation
% 0.14/0.35 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.35 cnf(i_0_39, hypothesis, (situation(s0))).
% 0.14/0.35 cnf(i_0_45, hypothesis, (at(f,s0))).
% 0.14/0.35 cnf(i_0_46, negated_conjecture, (~at(a,X1)|~situation(X1))).
% 0.14/0.35 cnf(i_0_40, hypothesis, (situation(walk(X1,X2))|~situation(X2))).
% 0.14/0.35 cnf(i_0_41, hypothesis, (situation(drive(X1,X2))|~situation(X2))).
% 0.14/0.35 cnf(i_0_24, hypothesis, (cold(X1)|warm(X2)|~situation(X1)|~situation(X2))).
% 0.14/0.35 cnf(i_0_43, hypothesis, (situation(skate(X1,X2))|~situation(X2))).
% 0.14/0.35 cnf(i_0_42, hypothesis, (situation(climb(X1,X2))|~situation(X2))).
% 0.14/0.35 cnf(i_0_44, hypothesis, (situation(go(X1,X2))|~situation(X2))).
% 0.14/0.35 cnf(i_0_27, hypothesis, (at(a,walk(a,X1))|~at(b,X1)|~situation(X1))).
% 0.14/0.35 cnf(i_0_28, hypothesis, (at(a,drive(a,X1))|~at(b,X1)|~situation(X1))).
% 0.14/0.35 cnf(i_0_34, hypothesis, (at(c,go(c,X1))|~at(d,X1)|~situation(X1))).
% 0.14/0.35 cnf(i_0_36, hypothesis, (at(c,go(c,X1))|~at(e,X1)|~situation(X1))).
% 0.14/0.35 cnf(i_0_33, hypothesis, (at(d,go(d,X1))|~at(c,X1)|~situation(X1))).
% 0.14/0.35 cnf(i_0_38, hypothesis, (at(d,go(d,X1))|~at(f,X1)|~situation(X1))).
% 0.14/0.35 cnf(i_0_35, hypothesis, (at(e,go(e,X1))|~at(c,X1)|~situation(X1))).
% 0.14/0.35 cnf(i_0_37, hypothesis, (at(f,go(f,X1))|~at(d,X1)|~situation(X1))).
% 0.14/0.35 cnf(i_0_30, hypothesis, (at(b,skate(b,X1))|~at(c,X1)|~situation(X1)|~cold(X1))).
% 0.14/0.35 cnf(i_0_32, hypothesis, (at(b,climb(b,X1))|~at(d,X1)|~situation(X1)|~warm(X1))).
% 0.14/0.35 cnf(i_0_29, hypothesis, (at(c,skate(c,X1))|~at(b,X1)|~situation(X1)|~cold(X1))).
% 0.14/0.35 cnf(i_0_31, hypothesis, (at(d,climb(d,X1))|~at(b,X1)|~situation(X1)|~warm(X1))).
% 0.14/0.35 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.35 # Begin printing tableau
% 0.14/0.35 # Found 7 steps
% 0.14/0.35 cnf(i_0_39, hypothesis, (situation(s0)), inference(start_rule)).
% 0.14/0.35 cnf(i_0_105, plain, (situation(s0)), inference(extension_rule, [i_0_32])).
% 0.14/0.35 cnf(i_0_205, plain, (at(b,climb(b,s0))), inference(extension_rule, [i_0_27])).
% 0.14/0.35 cnf(i_0_206, plain, (~at(d,s0)), inference(etableau_closure_rule, [i_0_206, ...])).
% 0.14/0.35 cnf(i_0_208, plain, (~warm(s0)), inference(etableau_closure_rule, [i_0_208, ...])).
% 0.14/0.35 cnf(i_0_233, plain, (at(a,walk(a,climb(b,s0)))), inference(etableau_closure_rule, [i_0_233, ...])).
% 0.14/0.35 cnf(i_0_235, plain, (~situation(climb(b,s0))), inference(etableau_closure_rule, [i_0_235, ...])).
% 0.14/0.35 # End printing tableau
% 0.14/0.35 # SZS output end
% 0.14/0.35 # Branches closed with saturation will be marked with an "s"
% 0.14/0.35 # Child (5628) has found a proof.
% 0.14/0.35
% 0.14/0.35 # Proof search is over...
% 0.14/0.35 # Freeing feature tree
%------------------------------------------------------------------------------