TSTP Solution File: SWV540-1.004 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV540-1.004 : TPTP v8.1.0. Released v4.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 : n007.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 : Wed Jul 20 18:21:50 EDT 2022
% Result : Unsatisfiable 10.56s 1.73s
% Output : CNFRefutation 10.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV540-1.004 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 19:32:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.12/0.36 # and selection function SelectNewComplexAHP.
% 0.12/0.36 #
% 0.12/0.36 # Number of axioms: 31 Number of unprocessed: 31
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 31 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 1 conjectures.
% 0.12/0.36 # There are 1 start rule candidates:
% 0.12/0.36 # Found 29 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 2 extension rule candidate clauses
% 0.12/0.36 # 29 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # Returning from population with 34 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 34 tableaux to operate on
% 10.56/1.73 # There were 2 total branch saturation attempts.
% 10.56/1.73 # There were 0 of these attempts blocked.
% 10.56/1.73 # There were 0 deferred branch saturation attempts.
% 10.56/1.73 # There were 0 free duplicated saturations.
% 10.56/1.73 # There were 1 total successful branch saturations.
% 10.56/1.73 # There were 0 successful branch saturations in interreduction.
% 10.56/1.73 # There were 0 successful branch saturations on the branch.
% 10.56/1.73 # There were 1 successful branch saturations after the branch.
% 10.56/1.73 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.56/1.73 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.56/1.73 # Begin clausification derivation
% 10.56/1.73
% 10.56/1.73 # End clausification derivation
% 10.56/1.73 # Begin listing active clauses obtained from FOF to CNF conversion
% 10.56/1.73 cnf(i_0_62, negated_conjecture, (a_440!=a_430)).
% 10.56/1.73 cnf(i_0_51, hypothesis, (select(a1,i1)=e_416)).
% 10.56/1.73 cnf(i_0_52, hypothesis, (select(a_418,i3)=e_419)).
% 10.56/1.73 cnf(i_0_53, hypothesis, (select(a_418,i0)=e_421)).
% 10.56/1.73 cnf(i_0_54, hypothesis, (select(a_422,i2)=e_423)).
% 10.56/1.73 cnf(i_0_55, hypothesis, (select(a_422,i3)=e_425)).
% 10.56/1.73 cnf(i_0_56, hypothesis, (select(a_426,i0)=e_427)).
% 10.56/1.73 cnf(i_0_57, hypothesis, (select(a_426,i2)=e_429)).
% 10.56/1.73 cnf(i_0_58, hypothesis, (select(a_432,i2)=e_433)).
% 10.56/1.73 cnf(i_0_59, hypothesis, (select(a_432,i3)=e_435)).
% 10.56/1.73 cnf(i_0_60, hypothesis, (select(a_436,i2)=e_437)).
% 10.56/1.73 cnf(i_0_61, hypothesis, (select(a_436,i0)=e_439)).
% 10.56/1.73 cnf(i_0_37, hypothesis, (store(a1,i1,e_416)=a_417)).
% 10.56/1.73 cnf(i_0_38, hypothesis, (store(a_417,i1,e_416)=a_418)).
% 10.56/1.73 cnf(i_0_39, hypothesis, (store(a_418,i0,e_419)=a_420)).
% 10.56/1.73 cnf(i_0_40, hypothesis, (store(a_420,i3,e_421)=a_422)).
% 10.56/1.73 cnf(i_0_41, hypothesis, (store(a_422,i3,e_423)=a_424)).
% 10.56/1.73 cnf(i_0_42, hypothesis, (store(a_424,i2,e_425)=a_426)).
% 10.56/1.73 cnf(i_0_43, hypothesis, (store(a_426,i2,e_427)=a_428)).
% 10.56/1.73 cnf(i_0_44, hypothesis, (store(a_428,i0,e_429)=a_430)).
% 10.56/1.73 cnf(i_0_45, hypothesis, (store(a_418,i3,e_421)=a_431)).
% 10.56/1.73 cnf(i_0_46, hypothesis, (store(a_431,i0,e_419)=a_432)).
% 10.56/1.73 cnf(i_0_47, hypothesis, (store(a_432,i3,e_433)=a_434)).
% 10.56/1.73 cnf(i_0_48, hypothesis, (store(a_434,i2,e_435)=a_436)).
% 10.56/1.73 cnf(i_0_49, hypothesis, (store(a_436,i0,e_437)=a_438)).
% 10.56/1.73 cnf(i_0_50, hypothesis, (store(a_438,i2,e_439)=a_440)).
% 10.56/1.73 cnf(i_0_34, plain, (store(X1,X2,select(X1,X2))=X1)).
% 10.56/1.73 cnf(i_0_32, plain, (select(store(X1,X2,X3),X2)=X3)).
% 10.56/1.73 cnf(i_0_33, plain, (X1=X2|select(store(X3,X1,X4),X2)=select(X3,X2))).
% 10.56/1.73 cnf(i_0_35, plain, (store(store(X1,X2,X3),X2,X4)=store(X1,X2,X4))).
% 10.56/1.73 cnf(i_0_36, plain, (X1=X2|store(store(X3,X1,X4),X2,X5)=store(store(X3,X2,X5),X1,X4))).
% 10.56/1.73 cnf(i_0_76, plain, (X6=X6)).
% 10.56/1.73 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 10.56/1.73 # Begin printing tableau
% 10.56/1.73 # Found 9 steps
% 10.56/1.73 cnf(i_0_52, hypothesis, (select(a_418,i3)=e_419), inference(start_rule)).
% 10.56/1.73 cnf(i_0_84, plain, (select(a_418,i3)=e_419), inference(extension_rule, [i_0_79])).
% 10.56/1.73 cnf(i_0_144, plain, (select(a_418,i3)!=e_419), inference(closure_rule, [i_0_52])).
% 10.56/1.73 cnf(i_0_142, plain, (select(a_418,i3)=select(a_418,i3)), inference(extension_rule, [i_0_80])).
% 10.56/1.73 cnf(i_0_155, plain, (select(a1,i1)!=e_416), inference(closure_rule, [i_0_51])).
% 10.56/1.73 cnf(i_0_156, plain, (select(a1,i1)!=e_416), inference(closure_rule, [i_0_51])).
% 10.56/1.73 cnf(i_0_153, plain, (store(select(a_418,i3),select(a1,i1),select(a1,i1))=store(select(a_418,i3),e_416,e_416)), inference(extension_rule, [i_0_81])).
% 10.56/1.73 cnf(i_0_143556, plain, (select(a1,i1)!=e_416), inference(closure_rule, [i_0_51])).
% 10.56/1.73 cnf(i_0_143554, plain, (select(store(select(a_418,i3),select(a1,i1),select(a1,i1)),select(a1,i1))=select(store(select(a_418,i3),e_416,e_416),e_416)), inference(etableau_closure_rule, [i_0_143554, ...])).
% 10.56/1.73 # End printing tableau
% 10.56/1.73 # SZS output end
% 10.56/1.73 # Branches closed with saturation will be marked with an "s"
% 10.92/1.73 # Child (25004) has found a proof.
% 10.92/1.73
% 10.92/1.73 # Proof search is over...
% 10.92/1.73 # Freeing feature tree
%------------------------------------------------------------------------------